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/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:16:20,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:16:20,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:16:20,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:16:20,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:16:20,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:16:20,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:16:20,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:16:20,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:16:20,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:16:20,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:16:20,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:16:20,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:16:20,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:16:20,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:16:20,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:16:20,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:16:20,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:16:20,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:16:20,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:16:20,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:16:20,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:16:20,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:16:20,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:16:20,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:16:20,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:16:20,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:16:20,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:16:20,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:16:20,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:16:20,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:16:20,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:16:20,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:16:20,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:16:20,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:16:20,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:16:20,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:16:20,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:16:20,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:16:20,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:16:20,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:16:20,849 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-09-16 16:16:20,866 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:16:20,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:16:20,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:16:20,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:16:20,871 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:16:20,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:16:20,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:16:20,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:16:20,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:16:20,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:16:20,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:16:20,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:16:20,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:16:20,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:16:20,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:16:20,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:16:20,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:16:20,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:16:20,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:16:20,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:16:20,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:16:20,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:16:20,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:16:20,878 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:16:20,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:16:20,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:16:20,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:16:20,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:16:20,931 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:16:20,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-16 16:16:20,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c56b2217/4b14fdaeaf04405fb6677c61551a0c8f/FLAGd34975448 [2019-09-16 16:16:21,400 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:16:21,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-16 16:16:21,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c56b2217/4b14fdaeaf04405fb6677c61551a0c8f/FLAGd34975448 [2019-09-16 16:16:21,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c56b2217/4b14fdaeaf04405fb6677c61551a0c8f [2019-09-16 16:16:21,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:16:21,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:16:21,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:16:21,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:16:21,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:16:21,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:16:21" (1/1) ... [2019-09-16 16:16:21,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31230a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:21, skipping insertion in model container [2019-09-16 16:16:21,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:16:21" (1/1) ... [2019-09-16 16:16:21,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:16:21,815 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:16:22,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:16:22,252 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:16:22,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:16:22,368 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:16:22,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22 WrapperNode [2019-09-16 16:16:22,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:16:22,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:16:22,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:16:22,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:16:22,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (1/1) ... [2019-09-16 16:16:22,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:16:22,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:16:22,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:16:22,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:16:22,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (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-09-16 16:16:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:16:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:16:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-16 16:16:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-16 16:16:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-16 16:16:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-16 16:16:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-16 16:16:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-16 16:16:22,573 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-16 16:16:22,574 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-16 16:16:22,574 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-16 16:16:22,574 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-16 16:16:22,575 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-16 16:16:22,575 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-16 16:16:22,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-16 16:16:22,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-16 16:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-16 16:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-16 16:16:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-16 16:16:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:16:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-16 16:16:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-16 16:16:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-16 16:16:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-16 16:16:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-16 16:16:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-16 16:16:22,581 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-16 16:16:22,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:16:22,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 16:16:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:16:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 16:16:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 16:16:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-16 16:16:22,583 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-16 16:16:22,584 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-16 16:16:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-16 16:16:22,585 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-16 16:16:22,586 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-16 16:16:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:16:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-16 16:16:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:16:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:16:23,007 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,146 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-16 16:16:23,147 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-16 16:16:23,155 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,211 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-16 16:16:23,211 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-16 16:16:23,235 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,268 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-16 16:16:23,268 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-16 16:16:23,276 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,290 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-16 16:16:23,290 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-16 16:16:23,532 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,566 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-16 16:16:23,567 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-16 16:16:23,595 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 16:16:23,613 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-16 16:16:23,613 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-16 16:16:23,657 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:16:23,657 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:16:23,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:16:23 BoogieIcfgContainer [2019-09-16 16:16:23,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:16:23,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:16:23,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:16:23,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:16:23,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:16:21" (1/3) ... [2019-09-16 16:16:23,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615553ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:16:23, skipping insertion in model container [2019-09-16 16:16:23,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:16:22" (2/3) ... [2019-09-16 16:16:23,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615553ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:16:23, skipping insertion in model container [2019-09-16 16:16:23,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:16:23" (3/3) ... [2019-09-16 16:16:23,667 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-09-16 16:16:23,676 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:16:23,684 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:16:23,701 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:16:23,734 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:16:23,735 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:16:23,735 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:16:23,735 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:16:23,735 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:16:23,736 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:16:23,736 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:16:23,736 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:16:23,736 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:16:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-09-16 16:16:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:16:23,782 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:23,783 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:16:23,785 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:23,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-09-16 16:16:23,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:23,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:23,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:23,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:24,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:24,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:24,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:24,080 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-09-16 16:16:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:24,307 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2019-09-16 16:16:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:24,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 16:16:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:24,323 INFO L225 Difference]: With dead ends: 537 [2019-09-16 16:16:24,324 INFO L226 Difference]: Without dead ends: 287 [2019-09-16 16:16:24,331 INFO L636 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-09-16 16:16:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-16 16:16:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-09-16 16:16:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-16 16:16:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-09-16 16:16:24,414 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-09-16 16:16:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:24,415 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-09-16 16:16:24,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-09-16 16:16:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:16:24,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:24,417 INFO L407 BasicCegarLoop]: trace histogram [1, 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-09-16 16:16:24,417 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-09-16 16:16:24,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:24,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:24,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:24,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:24,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:24,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:24,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:24,580 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-09-16 16:16:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:24,803 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2019-09-16 16:16:24,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:24,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:16:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:24,814 INFO L225 Difference]: With dead ends: 637 [2019-09-16 16:16:24,815 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 16:16:24,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 16:16:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-09-16 16:16:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-16 16:16:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-09-16 16:16:24,881 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-09-16 16:16:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:24,881 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-09-16 16:16:24,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-09-16 16:16:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:16:24,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:24,884 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:24,884 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-09-16 16:16:24,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:24,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:24,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:24,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:24,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:24,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:24,986 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-09-16 16:16:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:25,055 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2019-09-16 16:16:25,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:25,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:16:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:25,064 INFO L225 Difference]: With dead ends: 963 [2019-09-16 16:16:25,065 INFO L226 Difference]: Without dead ends: 646 [2019-09-16 16:16:25,067 INFO L636 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-09-16 16:16:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-16 16:16:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-09-16 16:16:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-16 16:16:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-09-16 16:16:25,121 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-09-16 16:16:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:25,122 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-09-16 16:16:25,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-09-16 16:16:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:16:25,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:25,125 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:25,125 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:25,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-09-16 16:16:25,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:25,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:25,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:25,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:25,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:25,222 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-09-16 16:16:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:25,313 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2019-09-16 16:16:25,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:25,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-16 16:16:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:25,321 INFO L225 Difference]: With dead ends: 621 [2019-09-16 16:16:25,321 INFO L226 Difference]: Without dead ends: 617 [2019-09-16 16:16:25,322 INFO L636 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-09-16 16:16:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-16 16:16:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-16 16:16:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-16 16:16:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-09-16 16:16:25,367 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-09-16 16:16:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:25,368 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-09-16 16:16:25,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-09-16 16:16:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:16:25,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:25,374 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:25,374 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-09-16 16:16:25,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:25,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:25,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:25,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:25,449 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-09-16 16:16:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:25,513 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2019-09-16 16:16:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:25,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-16 16:16:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:25,521 INFO L225 Difference]: With dead ends: 1072 [2019-09-16 16:16:25,522 INFO L226 Difference]: Without dead ends: 1053 [2019-09-16 16:16:25,523 INFO L636 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-09-16 16:16:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-16 16:16:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-09-16 16:16:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-09-16 16:16:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-09-16 16:16:25,577 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-09-16 16:16:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:25,577 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-09-16 16:16:25,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-09-16 16:16:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 16:16:25,579 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:25,579 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:25,579 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-09-16 16:16:25,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:25,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:25,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:25,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:25,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:25,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:25,620 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-09-16 16:16:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:25,718 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2019-09-16 16:16:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:25,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-16 16:16:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:25,727 INFO L225 Difference]: With dead ends: 1050 [2019-09-16 16:16:25,727 INFO L226 Difference]: Without dead ends: 1045 [2019-09-16 16:16:25,728 INFO L636 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-09-16 16:16:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-16 16:16:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-09-16 16:16:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-16 16:16:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-09-16 16:16:25,783 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-09-16 16:16:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:25,783 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-09-16 16:16:25,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-09-16 16:16:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:16:25,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:25,786 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:25,786 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-09-16 16:16:25,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:25,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:25,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:25,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:25,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:25,858 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-09-16 16:16:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:25,916 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2019-09-16 16:16:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:16:25,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-16 16:16:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:25,925 INFO L225 Difference]: With dead ends: 1058 [2019-09-16 16:16:25,925 INFO L226 Difference]: Without dead ends: 1036 [2019-09-16 16:16:25,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-16 16:16:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-09-16 16:16:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-16 16:16:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-09-16 16:16:26,020 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-09-16 16:16:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:26,020 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-09-16 16:16:26,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-09-16 16:16:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:16:26,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:26,023 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:26,023 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-09-16 16:16:26,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:26,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:26,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:26,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:26,103 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-09-16 16:16:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:26,149 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2019-09-16 16:16:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:26,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 16:16:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:26,155 INFO L225 Difference]: With dead ends: 1448 [2019-09-16 16:16:26,155 INFO L226 Difference]: Without dead ends: 578 [2019-09-16 16:16:26,162 INFO L636 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-09-16 16:16:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-16 16:16:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-16 16:16:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 16:16:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-09-16 16:16:26,195 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-09-16 16:16:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:26,195 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-09-16 16:16:26,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-09-16 16:16:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:16:26,196 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:26,196 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:26,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-09-16 16:16:26,197 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:26,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:26,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:26,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 16:16:26,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:16:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:16:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:16:26,326 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-09-16 16:16:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:27,270 INFO L93 Difference]: Finished difference Result 607 states and 855 transitions. [2019-09-16 16:16:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:16:27,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-16 16:16:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:27,276 INFO L225 Difference]: With dead ends: 607 [2019-09-16 16:16:27,276 INFO L226 Difference]: Without dead ends: 601 [2019-09-16 16:16:27,277 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-16 16:16:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-16 16:16:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-16 16:16:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 16:16:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-09-16 16:16:27,317 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-09-16 16:16:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:27,317 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-09-16 16:16:27,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:16:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-09-16 16:16:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:16:27,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:27,319 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:27,319 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-09-16 16:16:27,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:27,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:27,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:27,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:27,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 16:16:27,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:16:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:16:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:16:27,435 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-09-16 16:16:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:28,241 INFO L93 Difference]: Finished difference Result 607 states and 853 transitions. [2019-09-16 16:16:28,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:16:28,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-16 16:16:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:28,246 INFO L225 Difference]: With dead ends: 607 [2019-09-16 16:16:28,246 INFO L226 Difference]: Without dead ends: 601 [2019-09-16 16:16:28,247 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-16 16:16:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-16 16:16:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-16 16:16:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 16:16:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-09-16 16:16:28,282 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-09-16 16:16:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:28,283 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-09-16 16:16:28,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:16:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-09-16 16:16:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 16:16:28,285 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:28,285 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:28,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-09-16 16:16:28,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:28,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:28,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:28,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:28,360 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-09-16 16:16:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:28,428 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-09-16 16:16:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:16:28,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-16 16:16:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:28,432 INFO L225 Difference]: With dead ends: 601 [2019-09-16 16:16:28,433 INFO L226 Difference]: Without dead ends: 576 [2019-09-16 16:16:28,434 INFO L636 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-09-16 16:16:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-16 16:16:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-16 16:16:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-16 16:16:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-09-16 16:16:28,473 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-09-16 16:16:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:28,473 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-09-16 16:16:28,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-09-16 16:16:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 16:16:28,474 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:28,474 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:28,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-09-16 16:16:28,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:28,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:28,513 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-09-16 16:16:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:28,634 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2019-09-16 16:16:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:28,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-16 16:16:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:28,640 INFO L225 Difference]: With dead ends: 810 [2019-09-16 16:16:28,641 INFO L226 Difference]: Without dead ends: 802 [2019-09-16 16:16:28,641 INFO L636 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-09-16 16:16:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-16 16:16:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-09-16 16:16:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-16 16:16:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-09-16 16:16:28,680 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-09-16 16:16:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:28,680 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-09-16 16:16:28,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-09-16 16:16:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 16:16:28,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:28,682 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:28,682 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-09-16 16:16:28,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:28,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:28,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:16:28,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:16:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:16:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:16:28,726 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-09-16 16:16:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:28,898 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2019-09-16 16:16:28,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:16:28,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-16 16:16:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:28,902 INFO L225 Difference]: With dead ends: 719 [2019-09-16 16:16:28,902 INFO L226 Difference]: Without dead ends: 452 [2019-09-16 16:16:28,904 INFO L636 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-09-16 16:16:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-16 16:16:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-09-16 16:16:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-16 16:16:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-09-16 16:16:28,928 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2019-09-16 16:16:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:28,928 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-09-16 16:16:28,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:16:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-09-16 16:16:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 16:16:28,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:28,930 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:28,930 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-09-16 16:16:28,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:28,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:28,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:29,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:16:29,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:16:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:16:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:29,006 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-09-16 16:16:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:29,198 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2019-09-16 16:16:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:16:29,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-16 16:16:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:29,201 INFO L225 Difference]: With dead ends: 447 [2019-09-16 16:16:29,201 INFO L226 Difference]: Without dead ends: 443 [2019-09-16 16:16:29,202 INFO L636 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-09-16 16:16:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-16 16:16:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-16 16:16:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-16 16:16:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-09-16 16:16:29,225 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-09-16 16:16:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:29,225 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-09-16 16:16:29,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:16:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-09-16 16:16:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 16:16:29,226 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:29,226 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:29,227 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-09-16 16:16:29,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:29,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:29,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:29,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:29,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:16:29,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:16:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:16:29,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:29,288 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-09-16 16:16:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:29,362 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2019-09-16 16:16:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:16:29,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-16 16:16:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:29,366 INFO L225 Difference]: With dead ends: 760 [2019-09-16 16:16:29,366 INFO L226 Difference]: Without dead ends: 462 [2019-09-16 16:16:29,368 INFO L636 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-09-16 16:16:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-16 16:16:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-09-16 16:16:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-16 16:16:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-16 16:16:29,393 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-09-16 16:16:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:29,393 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-16 16:16:29,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:16:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-16 16:16:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:16:29,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:29,395 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:29,395 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-09-16 16:16:29,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:29,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:29,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:29,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:29,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:29,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:29,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 16:16:29,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:16:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:16:29,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:16:29,536 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-09-16 16:16:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:30,442 INFO L93 Difference]: Finished difference Result 776 states and 1071 transitions. [2019-09-16 16:16:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:16:30,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-16 16:16:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:30,446 INFO L225 Difference]: With dead ends: 776 [2019-09-16 16:16:30,446 INFO L226 Difference]: Without dead ends: 475 [2019-09-16 16:16:30,448 INFO L636 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-09-16 16:16:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-16 16:16:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-09-16 16:16:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-16 16:16:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-16 16:16:30,473 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-09-16 16:16:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:30,473 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-16 16:16:30,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:16:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-16 16:16:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:16:30,475 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:30,475 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:30,475 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-09-16 16:16:30,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:30,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:30,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:30,545 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-09-16 16:16:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:31,063 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2019-09-16 16:16:31,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:16:31,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-16 16:16:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:31,068 INFO L225 Difference]: With dead ends: 580 [2019-09-16 16:16:31,068 INFO L226 Difference]: Without dead ends: 561 [2019-09-16 16:16:31,069 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-16 16:16:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-09-16 16:16:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-16 16:16:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-09-16 16:16:31,093 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-09-16 16:16:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:31,094 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-09-16 16:16:31,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-09-16 16:16:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 16:16:31,095 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:31,095 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:31,095 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-09-16 16:16:31,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:31,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:31,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:31,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:16:31,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:16:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:16:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:31,162 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-09-16 16:16:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:31,314 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2019-09-16 16:16:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:16:31,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-16 16:16:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:31,317 INFO L225 Difference]: With dead ends: 448 [2019-09-16 16:16:31,317 INFO L226 Difference]: Without dead ends: 417 [2019-09-16 16:16:31,317 INFO L636 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-09-16 16:16:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-16 16:16:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-09-16 16:16:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 16:16:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-09-16 16:16:31,337 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-09-16 16:16:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:31,337 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-09-16 16:16:31,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:16:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-09-16 16:16:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 16:16:31,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:31,339 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:31,339 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-09-16 16:16:31,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:31,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:31,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:31,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:31,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:31,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:31,410 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-09-16 16:16:31,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:31,473 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2019-09-16 16:16:31,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:31,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-16 16:16:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:31,478 INFO L225 Difference]: With dead ends: 432 [2019-09-16 16:16:31,478 INFO L226 Difference]: Without dead ends: 399 [2019-09-16 16:16:31,480 INFO L636 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-09-16 16:16:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-16 16:16:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-09-16 16:16:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-16 16:16:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-09-16 16:16:31,506 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-09-16 16:16:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:31,506 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-09-16 16:16:31,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-09-16 16:16:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 16:16:31,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:31,508 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:31,508 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-09-16 16:16:31,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:31,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:31,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:31,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:16:31,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:16:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:16:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:31,616 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-09-16 16:16:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:31,743 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2019-09-16 16:16:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:16:31,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-16 16:16:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:31,746 INFO L225 Difference]: With dead ends: 429 [2019-09-16 16:16:31,746 INFO L226 Difference]: Without dead ends: 408 [2019-09-16 16:16:31,747 INFO L636 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-09-16 16:16:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-16 16:16:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-09-16 16:16:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-16 16:16:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-09-16 16:16:31,767 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-09-16 16:16:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:31,767 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-09-16 16:16:31,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:16:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-09-16 16:16:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:16:31,768 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:31,769 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:31,769 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-09-16 16:16:31,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:31,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:31,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:31,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:16:31,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:16:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:16:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:16:31,806 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-09-16 16:16:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:31,841 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2019-09-16 16:16:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:16:31,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-16 16:16:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:31,844 INFO L225 Difference]: With dead ends: 436 [2019-09-16 16:16:31,844 INFO L226 Difference]: Without dead ends: 410 [2019-09-16 16:16:31,845 INFO L636 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-09-16 16:16:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-16 16:16:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-09-16 16:16:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-16 16:16:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-09-16 16:16:31,872 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-09-16 16:16:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:31,872 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-09-16 16:16:31,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:16:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-09-16 16:16:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:16:31,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:31,874 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:31,874 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-09-16 16:16:31,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:31,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:31,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:31,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:31,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 16:16:31,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:16:31,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:16:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:16:31,935 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-09-16 16:16:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:32,494 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2019-09-16 16:16:32,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:16:32,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-16 16:16:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:32,498 INFO L225 Difference]: With dead ends: 565 [2019-09-16 16:16:32,499 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 16:16:32,499 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:16:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 16:16:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-09-16 16:16:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-16 16:16:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-09-16 16:16:32,526 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-09-16 16:16:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:32,526 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-09-16 16:16:32,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:16:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-09-16 16:16:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:16:32,527 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:32,527 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:32,528 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:32,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-09-16 16:16:32,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:32,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:32,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:32,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:32,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:32,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:32,560 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-09-16 16:16:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:32,667 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2019-09-16 16:16:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:32,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-16 16:16:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:32,672 INFO L225 Difference]: With dead ends: 673 [2019-09-16 16:16:32,672 INFO L226 Difference]: Without dead ends: 659 [2019-09-16 16:16:32,673 INFO L636 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-09-16 16:16:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-16 16:16:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-09-16 16:16:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-16 16:16:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-09-16 16:16:32,711 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-09-16 16:16:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:32,711 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-09-16 16:16:32,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-09-16 16:16:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:16:32,712 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:32,712 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:32,712 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-09-16 16:16:32,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:32,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:32,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:32,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:16:32,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:16:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:16:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:32,782 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-09-16 16:16:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:32,856 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2019-09-16 16:16:32,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:16:32,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-16 16:16:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:32,860 INFO L225 Difference]: With dead ends: 598 [2019-09-16 16:16:32,861 INFO L226 Difference]: Without dead ends: 574 [2019-09-16 16:16:32,862 INFO L636 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-09-16 16:16:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-16 16:16:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-16 16:16:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-16 16:16:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-09-16 16:16:32,917 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-09-16 16:16:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:32,918 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-09-16 16:16:32,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:16:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-09-16 16:16:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:16:32,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:32,919 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:32,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-09-16 16:16:32,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:33,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:33,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 16:16:33,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:16:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:16:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:16:33,049 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-09-16 16:16:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:33,926 INFO L93 Difference]: Finished difference Result 597 states and 868 transitions. [2019-09-16 16:16:33,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:16:33,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-09-16 16:16:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:33,930 INFO L225 Difference]: With dead ends: 597 [2019-09-16 16:16:33,930 INFO L226 Difference]: Without dead ends: 573 [2019-09-16 16:16:33,931 INFO L636 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-09-16 16:16:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-16 16:16:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-09-16 16:16:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-16 16:16:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-09-16 16:16:33,963 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-09-16 16:16:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:33,964 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-09-16 16:16:33,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:16:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-09-16 16:16:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 16:16:33,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:33,965 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:33,965 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-09-16 16:16:33,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:33,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:34,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:34,028 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-09-16 16:16:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:34,468 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2019-09-16 16:16:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:16:34,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-16 16:16:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:34,473 INFO L225 Difference]: With dead ends: 659 [2019-09-16 16:16:34,473 INFO L226 Difference]: Without dead ends: 624 [2019-09-16 16:16:34,473 INFO L636 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-09-16 16:16:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-16 16:16:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-09-16 16:16:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-16 16:16:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-09-16 16:16:34,508 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-09-16 16:16:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:34,508 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-09-16 16:16:34,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-09-16 16:16:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 16:16:34,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:34,509 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:34,509 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-09-16 16:16:34,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:34,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:34,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:34,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:34,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:34,611 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-09-16 16:16:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:34,682 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2019-09-16 16:16:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-16 16:16:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:34,686 INFO L225 Difference]: With dead ends: 955 [2019-09-16 16:16:34,686 INFO L226 Difference]: Without dead ends: 527 [2019-09-16 16:16:34,689 INFO L636 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-09-16 16:16:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-16 16:16:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-16 16:16:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-16 16:16:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-09-16 16:16:34,717 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-09-16 16:16:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:34,717 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-09-16 16:16:34,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-09-16 16:16:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 16:16:34,718 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:34,718 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:34,719 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-09-16 16:16:34,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:34,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:34,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:34,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:34,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 16:16:34,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:16:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:16:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:16:34,810 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-09-16 16:16:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:34,965 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2019-09-16 16:16:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:16:34,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-16 16:16:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:34,969 INFO L225 Difference]: With dead ends: 529 [2019-09-16 16:16:34,969 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 16:16:34,970 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:16:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 16:16:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-16 16:16:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-16 16:16:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-09-16 16:16:34,996 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-09-16 16:16:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:34,996 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-09-16 16:16:34,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:16:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-09-16 16:16:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 16:16:34,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:34,997 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:34,997 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-09-16 16:16:34,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:35,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:35,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:35,049 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-09-16 16:16:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:35,110 INFO L93 Difference]: Finished difference Result 924 states and 1444 transitions. [2019-09-16 16:16:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:35,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-16 16:16:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:35,114 INFO L225 Difference]: With dead ends: 924 [2019-09-16 16:16:35,114 INFO L226 Difference]: Without dead ends: 497 [2019-09-16 16:16:35,118 INFO L636 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-09-16 16:16:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-16 16:16:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-09-16 16:16:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-16 16:16:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-09-16 16:16:35,152 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-09-16 16:16:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:35,152 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-09-16 16:16:35,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-09-16 16:16:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 16:16:35,153 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:35,153 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:35,153 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-09-16 16:16:35,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:35,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:35,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:35,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:16:35,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:16:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:16:35,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:16:35,192 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-09-16 16:16:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:35,278 INFO L93 Difference]: Finished difference Result 735 states and 1199 transitions. [2019-09-16 16:16:35,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:16:35,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-16 16:16:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:35,284 INFO L225 Difference]: With dead ends: 735 [2019-09-16 16:16:35,284 INFO L226 Difference]: Without dead ends: 732 [2019-09-16 16:16:35,285 INFO L636 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-09-16 16:16:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-16 16:16:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-09-16 16:16:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-16 16:16:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-09-16 16:16:35,318 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-09-16 16:16:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:35,318 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-09-16 16:16:35,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:16:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-09-16 16:16:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 16:16:35,319 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:35,319 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:35,320 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash -554950542, now seen corresponding path program 1 times [2019-09-16 16:16:35,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:35,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:35,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:35,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:35,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:16:35,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:16:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:16:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:16:35,476 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-09-16 16:16:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:36,367 INFO L93 Difference]: Finished difference Result 1228 states and 2118 transitions. [2019-09-16 16:16:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:16:36,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-16 16:16:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:36,375 INFO L225 Difference]: With dead ends: 1228 [2019-09-16 16:16:36,375 INFO L226 Difference]: Without dead ends: 786 [2019-09-16 16:16:36,379 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:16:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-16 16:16:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-09-16 16:16:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-16 16:16:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-09-16 16:16:36,418 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 64 [2019-09-16 16:16:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:36,419 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-09-16 16:16:36,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:16:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-09-16 16:16:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 16:16:36,420 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:36,420 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:36,420 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:36,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-09-16 16:16:36,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:36,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:36,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:36,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:36,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:36,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:36,538 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-09-16 16:16:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:36,598 INFO L93 Difference]: Finished difference Result 808 states and 1290 transitions. [2019-09-16 16:16:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:36,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-16 16:16:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:36,602 INFO L225 Difference]: With dead ends: 808 [2019-09-16 16:16:36,602 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 16:16:36,606 INFO L636 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-09-16 16:16:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 16:16:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-09-16 16:16:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-16 16:16:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-09-16 16:16:36,631 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-09-16 16:16:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:36,632 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-09-16 16:16:36,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-09-16 16:16:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-16 16:16:36,633 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:36,633 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:36,633 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:36,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-09-16 16:16:36,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:36,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:36,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:36,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:36,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:36,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:36,698 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-09-16 16:16:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:36,915 INFO L93 Difference]: Finished difference Result 602 states and 874 transitions. [2019-09-16 16:16:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:16:36,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-16 16:16:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:36,917 INFO L225 Difference]: With dead ends: 602 [2019-09-16 16:16:36,917 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 16:16:36,921 INFO L636 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-09-16 16:16:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 16:16:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-16 16:16:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-16 16:16:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-09-16 16:16:36,943 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-09-16 16:16:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:36,944 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-09-16 16:16:36,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-09-16 16:16:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 16:16:36,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:36,945 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:36,945 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:36,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-09-16 16:16:36,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:37,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 16:16:37,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:16:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:16:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:16:37,097 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-09-16 16:16:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:37,967 INFO L93 Difference]: Finished difference Result 632 states and 901 transitions. [2019-09-16 16:16:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:16:37,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-16 16:16:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:37,972 INFO L225 Difference]: With dead ends: 632 [2019-09-16 16:16:37,972 INFO L226 Difference]: Without dead ends: 384 [2019-09-16 16:16:37,974 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-16 16:16:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-16 16:16:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-09-16 16:16:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-16 16:16:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-09-16 16:16:38,020 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-09-16 16:16:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:38,021 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-09-16 16:16:38,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:16:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-09-16 16:16:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 16:16:38,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:38,022 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:38,022 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-09-16 16:16:38,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:38,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:38,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:38,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:38,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:38,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:38,132 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-09-16 16:16:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:38,714 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2019-09-16 16:16:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:38,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-16 16:16:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:38,719 INFO L225 Difference]: With dead ends: 671 [2019-09-16 16:16:38,719 INFO L226 Difference]: Without dead ends: 407 [2019-09-16 16:16:38,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:16:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-16 16:16:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-09-16 16:16:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-16 16:16:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-09-16 16:16:38,756 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-09-16 16:16:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:38,756 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-09-16 16:16:38,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-09-16 16:16:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 16:16:38,757 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:38,757 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:38,757 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-09-16 16:16:38,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:38,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:38,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:38,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:38,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-09-16 16:16:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:38,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:38,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:38,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:38,837 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-09-16 16:16:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:38,890 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2019-09-16 16:16:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:38,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-16 16:16:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:38,893 INFO L225 Difference]: With dead ends: 676 [2019-09-16 16:16:38,893 INFO L226 Difference]: Without dead ends: 369 [2019-09-16 16:16:38,895 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:16:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-16 16:16:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-16 16:16:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-16 16:16:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-09-16 16:16:38,922 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-09-16 16:16:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:38,922 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-09-16 16:16:38,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-09-16 16:16:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 16:16:38,924 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:38,924 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:38,924 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-09-16 16:16:38,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:38,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:39,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:39,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:39,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:39,003 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-09-16 16:16:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:39,396 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2019-09-16 16:16:39,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:16:39,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-16 16:16:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:39,400 INFO L225 Difference]: With dead ends: 642 [2019-09-16 16:16:39,400 INFO L226 Difference]: Without dead ends: 337 [2019-09-16 16:16:39,406 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-09-16 16:16:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-16 16:16:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-09-16 16:16:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-16 16:16:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-09-16 16:16:39,437 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-09-16 16:16:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:39,439 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-09-16 16:16:39,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-09-16 16:16:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 16:16:39,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:39,441 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:39,442 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-09-16 16:16:39,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:39,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:39,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:39,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:39,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:39,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:39,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-16 16:16:39,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 16:16:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 16:16:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:16:39,603 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-09-16 16:16:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:39,766 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2019-09-16 16:16:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 16:16:39,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-09-16 16:16:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:39,769 INFO L225 Difference]: With dead ends: 357 [2019-09-16 16:16:39,769 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 16:16:39,769 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:16:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 16:16:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-16 16:16:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-16 16:16:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-09-16 16:16:39,801 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-09-16 16:16:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:39,802 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-09-16 16:16:39,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 16:16:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-09-16 16:16:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 16:16:39,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:39,804 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:39,804 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-09-16 16:16:39,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:39,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:39,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:16:39,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:16:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:16:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:16:39,899 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-09-16 16:16:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:40,243 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2019-09-16 16:16:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:40,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-16 16:16:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:40,246 INFO L225 Difference]: With dead ends: 726 [2019-09-16 16:16:40,246 INFO L226 Difference]: Without dead ends: 458 [2019-09-16 16:16:40,247 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-09-16 16:16:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-16 16:16:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-09-16 16:16:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 16:16:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-09-16 16:16:40,278 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-09-16 16:16:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:40,279 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-09-16 16:16:40,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:16:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-09-16 16:16:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 16:16:40,280 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:40,280 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:40,280 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-09-16 16:16:40,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:40,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:40,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-09-16 16:16:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 16:16:40,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:16:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:16:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:16:40,421 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-09-16 16:16:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:42,344 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2019-09-16 16:16:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 16:16:42,344 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-16 16:16:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:42,347 INFO L225 Difference]: With dead ends: 816 [2019-09-16 16:16:42,347 INFO L226 Difference]: Without dead ends: 774 [2019-09-16 16:16:42,348 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-16 16:16:42,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-16 16:16:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-09-16 16:16:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-16 16:16:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-09-16 16:16:42,387 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-09-16 16:16:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:42,388 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-09-16 16:16:42,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:16:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-09-16 16:16:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 16:16:42,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:42,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:42,390 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-09-16 16:16:42,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:42,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:42,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:42,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:42,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 16:16:42,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:16:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:16:42,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:16:42,535 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-09-16 16:16:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:45,064 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2019-09-16 16:16:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 16:16:45,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-16 16:16:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:45,074 INFO L225 Difference]: With dead ends: 797 [2019-09-16 16:16:45,074 INFO L226 Difference]: Without dead ends: 755 [2019-09-16 16:16:45,074 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-16 16:16:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-16 16:16:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-09-16 16:16:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-16 16:16:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-09-16 16:16:45,110 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-09-16 16:16:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:45,110 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-09-16 16:16:45,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:16:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-09-16 16:16:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 16:16:45,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:45,112 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:45,112 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-09-16 16:16:45,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:45,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:45,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:45,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:45,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-16 16:16:45,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 16:16:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 16:16:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:16:45,267 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-09-16 16:16:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:45,440 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2019-09-16 16:16:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 16:16:45,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-16 16:16:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:45,444 INFO L225 Difference]: With dead ends: 423 [2019-09-16 16:16:45,445 INFO L226 Difference]: Without dead ends: 396 [2019-09-16 16:16:45,445 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-16 16:16:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-16 16:16:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-09-16 16:16:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-16 16:16:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-09-16 16:16:45,477 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-09-16 16:16:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:45,477 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-09-16 16:16:45,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 16:16:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-09-16 16:16:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 16:16:45,482 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:45,482 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:45,482 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-09-16 16:16:45,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:45,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 16:16:45,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:16:45,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:16:45,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:16:45,651 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-09-16 16:16:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:47,537 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2019-09-16 16:16:47,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 16:16:47,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-16 16:16:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:47,542 INFO L225 Difference]: With dead ends: 781 [2019-09-16 16:16:47,542 INFO L226 Difference]: Without dead ends: 719 [2019-09-16 16:16:47,543 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-16 16:16:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-16 16:16:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-09-16 16:16:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-16 16:16:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-09-16 16:16:47,596 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-09-16 16:16:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:47,597 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-09-16 16:16:47,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:16:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-09-16 16:16:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 16:16:47,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:47,599 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:47,599 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:47,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-09-16 16:16:47,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:47,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:47,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:47,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:16:47,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:47,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 16:16:47,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 16:16:47,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 16:16:47,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 16:16:47,746 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-09-16 16:16:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:50,124 INFO L93 Difference]: Finished difference Result 681 states and 837 transitions. [2019-09-16 16:16:50,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 16:16:50,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-16 16:16:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:50,129 INFO L225 Difference]: With dead ends: 681 [2019-09-16 16:16:50,129 INFO L226 Difference]: Without dead ends: 617 [2019-09-16 16:16:50,130 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-16 16:16:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-16 16:16:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-09-16 16:16:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-16 16:16:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-09-16 16:16:50,162 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-09-16 16:16:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:50,162 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-09-16 16:16:50,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 16:16:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-09-16 16:16:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 16:16:50,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:50,164 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:16:50,164 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-09-16 16:16:50,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:50,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:50,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:50,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-16 16:16:50,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:50,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:50,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:50,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:50,261 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-09-16 16:16:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:50,311 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2019-09-16 16:16:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:50,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-16 16:16:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:50,313 INFO L225 Difference]: With dead ends: 468 [2019-09-16 16:16:50,313 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 16:16:50,314 INFO L636 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-09-16 16:16:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 16:16:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-09-16 16:16:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 16:16:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-09-16 16:16:50,339 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-09-16 16:16:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:50,339 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-09-16 16:16:50,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-09-16 16:16:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 16:16:50,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:50,342 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 16:16:50,342 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-09-16 16:16:50,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 16:16:50,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:16:50,438 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-09-16 16:16:50,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:50,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:16:50,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:16:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:16:50,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:16:50,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-16 16:16:50,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:16:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:16:50,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:16:50,820 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 10 states. [2019-09-16 16:16:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:50,948 INFO L93 Difference]: Finished difference Result 431 states and 516 transitions. [2019-09-16 16:16:50,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:16:50,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2019-09-16 16:16:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:50,951 INFO L225 Difference]: With dead ends: 431 [2019-09-16 16:16:50,951 INFO L226 Difference]: Without dead ends: 285 [2019-09-16 16:16:50,952 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:16:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-16 16:16:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-09-16 16:16:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-16 16:16:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 327 transitions. [2019-09-16 16:16:50,984 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 327 transitions. Word has length 163 [2019-09-16 16:16:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:50,984 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 327 transitions. [2019-09-16 16:16:50,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:16:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 327 transitions. [2019-09-16 16:16:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 16:16:50,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:50,987 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 16:16:50,987 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -713455478, now seen corresponding path program 1 times [2019-09-16 16:16:50,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 16:16:51,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:51,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:51,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:51,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:51,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:51,091 INFO L87 Difference]: Start difference. First operand 279 states and 327 transitions. Second operand 6 states. [2019-09-16 16:16:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:51,167 INFO L93 Difference]: Finished difference Result 441 states and 523 transitions. [2019-09-16 16:16:51,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:51,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-16 16:16:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:51,179 INFO L225 Difference]: With dead ends: 441 [2019-09-16 16:16:51,180 INFO L226 Difference]: Without dead ends: 307 [2019-09-16 16:16:51,181 INFO L636 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-09-16 16:16:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-16 16:16:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-09-16 16:16:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-16 16:16:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 312 transitions. [2019-09-16 16:16:51,236 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 312 transitions. Word has length 164 [2019-09-16 16:16:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:51,236 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 312 transitions. [2019-09-16 16:16:51,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 312 transitions. [2019-09-16 16:16:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-16 16:16:51,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:51,240 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-16 16:16:51,240 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -469124130, now seen corresponding path program 1 times [2019-09-16 16:16:51,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:51,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-16 16:16:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:51,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:51,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:51,381 INFO L87 Difference]: Start difference. First operand 272 states and 312 transitions. Second operand 6 states. [2019-09-16 16:16:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:51,432 INFO L93 Difference]: Finished difference Result 332 states and 379 transitions. [2019-09-16 16:16:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:51,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-09-16 16:16:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:51,435 INFO L225 Difference]: With dead ends: 332 [2019-09-16 16:16:51,435 INFO L226 Difference]: Without dead ends: 259 [2019-09-16 16:16:51,435 INFO L636 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-09-16 16:16:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-16 16:16:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 243. [2019-09-16 16:16:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-16 16:16:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2019-09-16 16:16:51,460 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 204 [2019-09-16 16:16:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:51,460 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2019-09-16 16:16:51,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2019-09-16 16:16:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-16 16:16:51,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:51,463 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-16 16:16:51,463 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash 336725440, now seen corresponding path program 1 times [2019-09-16 16:16:51,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:51,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:51,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-16 16:16:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:16:51,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:16:51,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:16:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:16:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:16:51,574 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand 6 states. [2019-09-16 16:16:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:51,613 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2019-09-16 16:16:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:16:51,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-16 16:16:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:51,614 INFO L225 Difference]: With dead ends: 243 [2019-09-16 16:16:51,614 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:16:51,615 INFO L636 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-09-16 16:16:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:16:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:16:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:16:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:16:51,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-09-16 16:16:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:51,634 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:16:51,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:16:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:16:51,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:16:51,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:16:54,979 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-09-16 16:16:55,267 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-16 16:16:55,667 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2019-09-16 16:16:55,980 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 1 [2019-09-16 16:16:56,366 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-09-16 16:16:56,626 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-16 16:16:56,810 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 1 [2019-09-16 16:16:57,027 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 58 [2019-09-16 16:16:57,232 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-16 16:16:57,518 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-09-16 16:16:58,452 WARN L191 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 83 [2019-09-16 16:16:58,686 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-09-16 16:16:59,155 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-09-16 16:16:59,260 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-16 16:16:59,528 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-09-16 16:16:59,914 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2019-09-16 16:17:00,464 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2019-09-16 16:17:00,749 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-16 16:17:01,268 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 68 [2019-09-16 16:17:01,452 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-16 16:17:02,014 WARN L191 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-09-16 16:17:02,549 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 71 [2019-09-16 16:17:02,809 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-16 16:17:03,159 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-16 16:17:03,416 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-09-16 16:17:03,820 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-16 16:17:04,008 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-09-16 16:17:04,804 WARN L191 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 81 [2019-09-16 16:17:05,210 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-09-16 16:17:05,491 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-16 16:17:05,678 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 1 [2019-09-16 16:17:06,161 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 68 [2019-09-16 16:17:06,460 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-09-16 16:17:07,039 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 78 [2019-09-16 16:17:07,450 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-09-16 16:17:08,610 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 172 DAG size of output: 91 [2019-09-16 16:17:08,902 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-09-16 16:17:09,226 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-09-16 16:17:09,488 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-09-16 16:17:09,882 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-09-16 16:17:10,017 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-09-16 16:17:10,331 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2019-09-16 16:17:10,694 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2019-09-16 16:17:10,911 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-16 16:17:11,333 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 68 [2019-09-16 16:17:11,830 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2019-09-16 16:17:12,364 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 71 [2019-09-16 16:17:12,754 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-09-16 16:17:13,302 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2019-09-16 16:17:13,616 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-09-16 16:17:14,114 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-09-16 16:17:15,276 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 172 DAG size of output: 91 [2019-09-16 16:17:15,490 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-16 16:17:15,974 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-09-16 16:17:16,244 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-16 16:17:16,609 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-16 16:17:16,807 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 1 [2019-09-16 16:17:17,189 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-16 16:17:17,646 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-09-16 16:17:17,996 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2019-09-16 16:17:19,380 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 182 DAG size of output: 108 [2019-09-16 16:17:19,967 WARN L191 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-16 16:17:20,243 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-16 16:17:20,503 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-09-16 16:17:20,655 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-16 16:17:20,895 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-16 16:17:21,502 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-09-16 16:17:21,758 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-16 16:17:22,034 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-09-16 16:17:22,429 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2019-09-16 16:17:22,573 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2019-09-16 16:17:22,574 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~SKIP2~0) (not (= 1 ~pended~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-09-16 16:17:22,574 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2019-09-16 16:17:22,574 INFO L446 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2019-09-16 16:17:22,574 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2019-09-16 16:17:22,574 INFO L439 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,575 INFO L439 ceAbstractionStarter]: At program point L787(lines 780 828) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~DC~0)) (.cse0 (not (= 1 ~pended~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= 0 ~routine~0)) (.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (and .cse0 (= main_~status~6 0) .cse1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse2 .cse0 .cse3 .cse4 .cse1 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~compRegistered~0)| 0)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse5 (and .cse2 .cse0 .cse3 .cse4 .cse1) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= main_~status~6 259))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= ~s~0 ~IPC~0) .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,575 INFO L443 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2019-09-16 16:17:22,575 INFO L443 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2019-09-16 16:17:22,576 INFO L439 ceAbstractionStarter]: At program point L779(lines 772 829) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~DC~0)) (.cse0 (not (= 1 ~pended~0))) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= 0 ~routine~0)) (.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (and .cse0 (= main_~status~6 0) .cse1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse2 .cse0 .cse3 .cse4 .cse1 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~compRegistered~0)| 0)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse5 (and .cse2 .cse0 .cse3 .cse4 .cse1) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= main_~status~6 259))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= ~s~0 ~IPC~0) .cse0 .cse2 .cse3 .cse4 .cse6 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,576 INFO L439 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~s~0 ~SKIP2~0) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,576 INFO L443 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2019-09-16 16:17:22,576 INFO L443 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2019-09-16 16:17:22,576 INFO L443 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2019-09-16 16:17:22,576 INFO L443 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2019-09-16 16:17:22,576 INFO L439 ceAbstractionStarter]: At program point L722(lines 721 762) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 0 ~routine~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L439 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2019-09-16 16:17:22,577 INFO L443 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L439 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,578 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (= ~s~0 ~SKIP2~0) (not (= 1 ~pended~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-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L439 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2019-09-16 16:17:22,578 INFO L443 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2019-09-16 16:17:22,579 INFO L439 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= 0 ~routine~0)) (.cse4 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse5 (<= ~s~0 ~NP~0)) (.cse6 (not (= 1 ~pended~0))) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= ~NP~0 1)) (.cse10 (= 1 ~s~0)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~myStatus~0 |old(~myStatus~0)|) .cse11 .cse12) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0) .cse11 .cse12) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,579 INFO L439 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= 0 ~routine~0)) (.cse4 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse5 (<= ~s~0 ~NP~0)) (.cse6 (not (= 1 ~pended~0))) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (<= ~NP~0 1)) (.cse10 (= 1 ~s~0)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~myStatus~0 |old(~myStatus~0)|) .cse11 .cse12) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~myStatus~0 1073741637) 0) .cse11 .cse12) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,579 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2019-09-16 16:17:22,579 INFO L439 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= 1 ~pended~0))) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 ~routine~0)) (.cse7 (= ~s~0 ~DC~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= main_~status~6 0) .cse7) (and .cse1 .cse0 .cse2 .cse4 .cse7 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse1 .cse0 .cse2 .cse4 .cse7)) (not (= main_~status~6 259))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,579 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2019-09-16 16:17:22,579 INFO L443 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2019-09-16 16:17:22,580 INFO L439 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= 1 ~pended~0))) (.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 ~routine~0)) (.cse7 (= ~s~0 ~DC~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= main_~status~6 0) .cse7) (and .cse1 .cse0 .cse2 .cse4 .cse7 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse1 .cse0 .cse2 .cse4 .cse7)) (not (= main_~status~6 259))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2019-09-16 16:17:22,580 INFO L439 ceAbstractionStarter]: At program point L727(lines 726 761) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,580 INFO L443 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2019-09-16 16:17:22,580 INFO L443 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2019-09-16 16:17:22,580 INFO L439 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,580 INFO L443 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2019-09-16 16:17:22,580 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2019-09-16 16:17:22,581 INFO L439 ceAbstractionStarter]: At program point L712(lines 711 764) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-09-16 16:17:22,581 INFO L439 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~DC~0)) (.cse1 (not (= 1 ~pended~0)))) (let ((.cse3 (let ((.cse4 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= 0 ~routine~0))) (or (and .cse4 .cse1 .cse5 .cse6 .cse2) (and .cse1 .cse4 .cse5 .cse6 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))))) (let ((.cse0 (and .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and .cse0 (<= (+ ~DC~0 1073742084) ~s~0)) (and .cse1 (= main_~status~6 0) .cse2) (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 (<= ~SKIP2~0 ~s~0) .cse0) (and .cse3 (or (<= (+ ~DC~0 1073742087) ~s~0) (not (= main_~status~6 259)))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse3 (<= ~IPC~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2019-09-16 16:17:22,581 INFO L446 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2019-09-16 16:17:22,581 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2019-09-16 16:17:22,581 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2019-09-16 16:17:22,581 INFO L443 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2019-09-16 16:17:22,581 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (= 1 ~s~0) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= 1 ~setEventCalled~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0))) (or .cse0 (not (= ~myStatus~0 0)))))) [2019-09-16 16:17:22,581 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L439 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= 1 ~setEventCalled~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0))) (or .cse0 (not (= ~myStatus~0 0))))) [2019-09-16 16:17:22,582 INFO L439 ceAbstractionStarter]: At program point L1055(lines 1054 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0))) [2019-09-16 16:17:22,582 INFO L443 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L439 ceAbstractionStarter]: At program point L1027(line 1027) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,582 INFO L443 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L443 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2019-09-16 16:17:22,582 INFO L439 ceAbstractionStarter]: At program point L1048(lines 1047 1070) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0))) [2019-09-16 16:17:22,583 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 1015 1099) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0))) [2019-09-16 16:17:22,583 INFO L439 ceAbstractionStarter]: At program point L1040(line 1040) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,583 INFO L439 ceAbstractionStarter]: At program point L1032(line 1032) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,583 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-09-16 16:17:22,583 INFO L443 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2019-09-16 16:17:22,583 INFO L443 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2019-09-16 16:17:22,583 INFO L439 ceAbstractionStarter]: At program point L1053(lines 1052 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0))) [2019-09-16 16:17:22,583 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2019-09-16 16:17:22,583 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L439 ceAbstractionStarter]: At program point L1067(lines 1023 1098) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0))) [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2019-09-16 16:17:22,584 INFO L439 ceAbstractionStarter]: At program point L1092(line 1092) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,584 INFO L443 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2019-09-16 16:17:22,585 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2019-09-16 16:17:22,585 INFO L439 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,585 INFO L443 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2019-09-16 16:17:22,585 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2019-09-16 16:17:22,585 INFO L439 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 211 235) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (not (= 1 ~pended~0)) (= ~s~0 |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,585 INFO L439 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,585 INFO L443 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L439 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 1 |old(~setEventCalled~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse8 (not (= 0 ~routine~0))) (.cse5 (= 1 ~pended~0)) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (<= |old(~setEventCalled~0)| 1)))) (let ((.cse0 (or .cse4 .cse9 .cse10 (not (<= 1 ~NP~0)) .cse11 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse12 (or .cse8 .cse5 .cse7) .cse13) (not (<= ~NP~0 1)) .cse14)) (.cse1 (not (= ~myStatus~0 0))) (.cse2 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse3 (or .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~s~0)|)) .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or .cse1 .cse3) (or .cse2 .cse3)))) [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2019-09-16 16:17:22,586 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2019-09-16 16:17:22,587 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2019-09-16 16:17:22,587 INFO L439 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 1 |old(~setEventCalled~0)|))) (.cse11 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse6 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse8 (not (= 0 ~routine~0))) (.cse5 (= 1 ~pended~0)) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (<= |old(~setEventCalled~0)| 1)))) (let ((.cse0 (or .cse4 .cse9 .cse10 (not (<= 1 ~NP~0)) .cse11 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse12 (or .cse8 .cse5 .cse7) .cse13) (not (<= ~NP~0 1)) .cse14)) (.cse1 (not (= ~myStatus~0 0))) (.cse2 (not (<= (+ ~myStatus~0 1073741637) 0)))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or (let ((.cse3 (or .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~s~0)|)) .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (and (or .cse1 .cse3) (or .cse2 .cse3))) (and (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))))) [2019-09-16 16:17:22,587 INFO L443 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2019-09-16 16:17:22,587 INFO L439 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse22 (<= (+ ~DC~0 5) ~IPC~0)) (.cse28 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse24 (= 0 ~routine~0)) (.cse25 (<= 1 ~compRegistered~0)) (.cse26 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= 1 ~pended~0)) (.cse29 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse23 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (<= ~NP~0 1)) (.cse21 (= 1 ~s~0)) (.cse27 (<= (+ ~MPR3~0 1) ~IPC~0))) (let ((.cse7 (and .cse22 .cse28 .cse24 .cse25 .cse26 (not (= ~MPR3~0 |old(~s~0)|)) (<= ~s~0 ~NP~0) (not .cse10) .cse29 .cse23 .cse20 .cse21 .cse27 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse9 (not .cse29)) (.cse14 (not .cse28)) (.cse15 (not (<= 1 |old(~setEventCalled~0)|))) (.cse16 (not .cse27)) (.cse11 (not .cse26)) (.cse17 (not .cse25)) (.cse13 (not .cse24)) (.cse12 (not .cse23)) (.cse18 (not .cse22)) (.cse19 (not (<= |old(~setEventCalled~0)| 1))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse21 .cse8)) (.cse1 (or .cse9 .cse14 .cse15 (not (<= 1 ~NP~0)) .cse16 .cse11 (not (= |old(~s~0)| ~MPR3~0)) (or .cse17 (or .cse13 .cse10 .cse12) .cse18) (not .cse20) .cse19)) (.cse3 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse4 (and (= |old(~customIrp~0)| 1) .cse7 (= 0 ~customIrp~0))) (.cse6 (or .cse9 .cse10 .cse11 .cse12 (not (= 1 |old(~s~0)|)) .cse13 (not (= |old(~s~0)| ~NP~0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (.cse5 (and .cse7 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse0 (or .cse3 .cse1)) (or (or .cse4 .cse5) (or .cse3 .cse6)) (or .cse2 .cse4 .cse6 .cse5))))) [2019-09-16 16:17:22,588 INFO L439 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse22 (<= (+ ~DC~0 5) ~IPC~0)) (.cse28 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse24 (= 0 ~routine~0)) (.cse25 (<= 1 ~compRegistered~0)) (.cse26 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (= 1 ~pended~0)) (.cse29 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse23 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse20 (<= ~NP~0 1)) (.cse21 (= 1 ~s~0)) (.cse27 (<= (+ ~MPR3~0 1) ~IPC~0))) (let ((.cse7 (and .cse22 .cse28 .cse24 .cse25 .cse26 (not (= ~MPR3~0 |old(~s~0)|)) (<= ~s~0 ~NP~0) (not .cse10) .cse29 .cse23 .cse20 .cse21 .cse27 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse9 (not .cse29)) (.cse14 (not .cse28)) (.cse15 (not (<= 1 |old(~setEventCalled~0)|))) (.cse16 (not .cse27)) (.cse11 (not .cse26)) (.cse17 (not .cse25)) (.cse13 (not .cse24)) (.cse12 (not .cse23)) (.cse18 (not .cse22)) (.cse19 (not (<= |old(~setEventCalled~0)| 1))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse21 .cse8)) (.cse1 (or .cse9 .cse14 .cse15 (not (<= 1 ~NP~0)) .cse16 .cse11 (not (= |old(~s~0)| ~MPR3~0)) (or .cse17 (or .cse13 .cse10 .cse12) .cse18) (not .cse20) .cse19)) (.cse3 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse4 (and (= |old(~customIrp~0)| 1) .cse7 (= 0 ~customIrp~0))) (.cse6 (or .cse9 .cse10 .cse11 .cse12 (not (= 1 |old(~s~0)|)) .cse13 (not (= |old(~s~0)| ~NP~0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (.cse5 (and .cse7 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse0 (or .cse3 .cse1)) (or (or .cse4 .cse5) (or .cse3 .cse6)) (or .cse2 .cse4 .cse6 .cse5))))) [2019-09-16 16:17:22,588 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse13 (= 1 ~pended~0)) (.cse10 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse14 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse12 (not (= 0 ~routine~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= 1 |old(~setEventCalled~0)|))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= 1 ~compRegistered~0))) (.cse15 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse16 (not (<= |old(~setEventCalled~0)| 1))) (.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (let ((.cse4 (not (= ~myStatus~0 0))) (.cse17 (and (= 1 ~s~0) .cse0 .cse1 .cse2)) (.cse5 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse18 (or .cse6 .cse13 .cse10 .cse14 (not (= 1 |old(~s~0)|)) .cse12 (not (= |old(~s~0)| ~NP~0)) .cse7 .cse8 .cse9 .cse11 .cse15 .cse16))) (and (or (and (= ~MPR3~0 ~s~0) .cse0 .cse1 .cse2) (let ((.cse3 (or .cse6 .cse7 .cse8 (not (<= 1 ~NP~0)) .cse9 .cse10 (not (= |old(~s~0)| ~MPR3~0)) (or .cse11 (or .cse12 .cse13 .cse14) .cse15) (not (<= ~NP~0 1)) .cse16))) (and (or .cse3 .cse4) (or .cse5 .cse3)))) (or .cse17 .cse4 .cse18) (or .cse17 .cse5 .cse18)))) [2019-09-16 16:17:22,588 INFO L439 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse0 (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (or (not (= |old(~s~0)| ~NP~0)) .cse0 (not (= ~compRegistered~0 0))))) [2019-09-16 16:17:22,588 INFO L443 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2019-09-16 16:17:22,589 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2019-09-16 16:17:22,589 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) .cse0 (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (= 1 ~s~0)) (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) .cse0 (not (= ~compRegistered~0 0))))) [2019-09-16 16:17:22,589 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2019-09-16 16:17:22,589 INFO L446 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2019-09-16 16:17:22,589 INFO L446 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2019-09-16 16:17:22,589 INFO L443 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2019-09-16 16:17:22,589 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2019-09-16 16:17:22,589 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2019-09-16 16:17:22,590 INFO L439 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (= |old(~customIrp~0)| ~customIrp~0) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~s~0 ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 ~s~0))))) (and (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse0) (or (not (= ~myStatus~0 0)) .cse0)))) [2019-09-16 16:17:22,590 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2019-09-16 16:17:22,590 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2019-09-16 16:17:22,590 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2019-09-16 16:17:22,590 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2019-09-16 16:17:22,590 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,590 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2019-09-16 16:17:22,591 INFO L439 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 186 210) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (not (= 1 ~pended~0)) (= ~s~0 |old(~s~0)|)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,591 INFO L439 ceAbstractionStarter]: At program point L206(line 206) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,591 INFO L443 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2019-09-16 16:17:22,591 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2019-09-16 16:17:22,591 INFO L439 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,591 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2019-09-16 16:17:22,591 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2019-09-16 16:17:22,591 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2019-09-16 16:17:22,592 INFO L439 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (and (= 0 ~routine~0) (<= 1 ~compRegistered~0) (not (= 1 ~pended~0)) (= 1 ~s~0)) (not (= DiskPerfStartDevice_~status~1 259)))) [2019-09-16 16:17:22,592 INFO L443 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2019-09-16 16:17:22,592 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-09-16 16:17:22,592 INFO L439 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (let ((.cse5 (= ~myStatus~0 |old(~myStatus~0)|)) (.cse0 (= 0 ~routine~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= 1 ~s~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (= DiskPerfStartDevice_~status~1 |old(~myStatus~0)|) .cse5) (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse16 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse6 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse6 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (and (not (= DiskPerfStartDevice_~status~1 259)) .cse5 (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) [2019-09-16 16:17:22,592 INFO L439 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,593 INFO L439 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (let ((.cse5 (= ~myStatus~0 |old(~myStatus~0)|)) (.cse0 (= 0 ~routine~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= 1 ~s~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (= DiskPerfStartDevice_~status~1 |old(~myStatus~0)|) .cse5) (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse10 (not (= 1 |old(~s~0)|))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse16 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse6 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse6 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (and (not (= DiskPerfStartDevice_~status~1 259)) .cse5 (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) [2019-09-16 16:17:22,593 INFO L439 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,593 INFO L443 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2019-09-16 16:17:22,593 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2019-09-16 16:17:22,593 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2019-09-16 16:17:22,593 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2019-09-16 16:17:22,593 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2019-09-16 16:17:22,594 INFO L439 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-09-16 16:17:22,594 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2019-09-16 16:17:22,594 INFO L443 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2019-09-16 16:17:22,594 INFO L439 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse12 (= 0 ~routine~0)) (.cse13 (<= 1 ~compRegistered~0)) (.cse14 (= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse15 (not (= 1 ~pended~0))) (.cse16 (= |old(~customIrp~0)| ~customIrp~0)) (.cse17 (<= 1 ~setEventCalled~0)) (.cse18 (<= ~setEventCalled~0 1))) (or (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (and .cse12 .cse13 .cse14 .cse15 (= 1 ~s~0) .cse16 .cse17 .cse18) (not (= DiskPerfForwardIrpSynchronous_~status~3 259))) (and .cse12 .cse13 .cse14 .cse15 (= ~MPR3~0 ~s~0) .cse16 .cse17 .cse18))) [2019-09-16 16:17:22,594 INFO L443 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2019-09-16 16:17:22,594 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2019-09-16 16:17:22,594 INFO L443 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2019-09-16 16:17:22,595 INFO L439 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse11 (and (= 0 ~routine~0) (<= 1 ~compRegistered~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) .cse11))) [2019-09-16 16:17:22,595 INFO L439 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,595 INFO L443 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2019-09-16 16:17:22,595 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2019-09-16 16:17:22,595 INFO L439 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-09-16 16:17:22,596 INFO L443 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2019-09-16 16:17:22,596 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2019-09-16 16:17:22,596 INFO L439 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (or (and .cse0 (= 1 ~s~0) .cse1 .cse2) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2) (let ((.cse3 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse3 (not (= ~myStatus~0 0))) (or .cse3 (not (<= (+ ~myStatus~0 1073741637) 0))))))) [2019-09-16 16:17:22,596 INFO L443 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2019-09-16 16:17:22,596 INFO L439 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,596 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L439 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,597 INFO L443 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L443 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2019-09-16 16:17:22,597 INFO L439 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,598 INFO L439 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0))))) (and (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (<= 0 DiskPerfRegisterDevice_~status~5))) [2019-09-16 16:17:22,598 INFO L443 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2019-09-16 16:17:22,598 INFO L439 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,598 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2019-09-16 16:17:22,598 INFO L439 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (and (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (<= 0 DiskPerfRegisterDevice_~status~5)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2019-09-16 16:17:22,599 INFO L439 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse1 (not (= 1 ~pended~0))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse0 (= DiskPerfRegisterDevice_~__cil_tmp32~0 259))) (or (and .cse0 (and .cse1 (= 1 ~s~0) .cse2 .cse3)) (let ((.cse4 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse4 (not (= ~myStatus~0 0))) (or .cse4 (not (<= (+ ~myStatus~0 1073741637) 0))))) (and (and .cse1 (= ~MPR3~0 ~s~0) .cse2 .cse3) .cse0))) [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2019-09-16 16:17:22,599 INFO L443 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2019-09-16 16:17:22,600 INFO L439 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,600 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-09-16 16:17:22,600 INFO L439 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse1 (not (= 1 ~pended~0))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse0 (= DiskPerfRegisterDevice_~__cil_tmp23~0 259))) (or (and .cse0 (and .cse1 (= 1 ~s~0) .cse2 .cse3)) (and (and .cse1 (= ~MPR3~0 ~s~0) .cse2 .cse3) .cse0 (<= 0 DiskPerfRegisterDevice_~status~5)) (let ((.cse4 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse4 (not (= ~myStatus~0 0))) (or .cse4 (not (<= (+ ~myStatus~0 1073741637) 0))))))) [2019-09-16 16:17:22,600 INFO L443 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2019-09-16 16:17:22,600 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2019-09-16 16:17:22,600 INFO L443 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2019-09-16 16:17:22,600 INFO L439 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2019-09-16 16:17:22,601 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2019-09-16 16:17:22,602 INFO L439 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,602 INFO L443 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2019-09-16 16:17:22,602 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2019-09-16 16:17:22,602 INFO L439 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1)) (.cse3 (= DiskPerfRegisterDevice_~__cil_tmp27~0 259))) (or (and (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2) .cse3) (and (and .cse0 (= 1 ~s~0) .cse1 .cse2) .cse3) (let ((.cse4 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse4 (not (= ~myStatus~0 0))) (or .cse4 (not (<= (+ ~myStatus~0 1073741637) 0))))))) [2019-09-16 16:17:22,602 INFO L439 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or (not (= 0 ~routine~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 1 |old(~pended~0)|) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= |old(~customIrp~0)| 0)) (not (= 1 |old(~s~0)|))))) (and (or .cse0 (not (= ~myStatus~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)))))) [2019-09-16 16:17:22,602 INFO L443 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2019-09-16 16:17:22,602 INFO L439 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,603 INFO L439 ceAbstractionStarter]: At program point L403-2(lines 403 410) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,603 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2019-09-16 16:17:22,603 INFO L439 ceAbstractionStarter]: At program point L428(line 428) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,603 INFO L443 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2019-09-16 16:17:22,603 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2019-09-16 16:17:22,603 INFO L443 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2019-09-16 16:17:22,603 INFO L439 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 353 434) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,603 INFO L443 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L439 ceAbstractionStarter]: At program point L396(line 396) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L439 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (= ~s~0 ~NP~0))) (or (and .cse0 .cse1 (<= (+ DiskPerfDeviceControl_~status~4 1073741789) 0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and .cse0 .cse1 (= DiskPerfDeviceControl_~status~4 0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)))) [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2019-09-16 16:17:22,604 INFO L443 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2019-09-16 16:17:22,605 INFO L439 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (= 1 |old(~pended~0)|)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse0 (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12))) [2019-09-16 16:17:22,605 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2019-09-16 16:17:22,605 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2019-09-16 16:17:22,605 INFO L439 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse14 (<= (+ ~MPR3~0 1) ~IPC~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse21 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse18 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse16 (= 0 ~routine~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse20 (not (= 1 ~pended~0))) (.cse22 (= 1 ~s~0)) (.cse19 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not .cse19)) (.cse9 (and (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2) .cse16 .cse17 .cse20 .cse22 (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not .cse18)) (.cse3 (not .cse21)) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not .cse15)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse11 (and .cse15 .cse16 .cse17 (not (= 259 DiskPerfRemoveDevice_~status~2)) .cse18 (<= ~s~0 ~NP~0) .cse19 .cse20 .cse21 (<= ~NP~0 1) .cse22 (<= 1 ~setEventCalled~0) .cse14 (<= ~setEventCalled~0 1))) (.cse10 (not .cse14)) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse13 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10 .cse12 .cse13)))) [2019-09-16 16:17:22,605 INFO L443 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2019-09-16 16:17:22,606 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (= 1 |old(~pended~0)|)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse0 (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12))) [2019-09-16 16:17:22,606 INFO L439 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 288 298) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-09-16 16:17:22,606 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2019-09-16 16:17:22,606 INFO L439 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-09-16 16:17:22,606 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2019-09-16 16:17:22,606 INFO L443 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2019-09-16 16:17:22,606 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2019-09-16 16:17:22,606 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L446 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L446 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2019-09-16 16:17:22,607 INFO L443 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2019-09-16 16:17:22,607 INFO L446 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2019-09-16 16:17:22,608 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2019-09-16 16:17:22,608 INFO L439 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (let ((.cse6 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse1 .cse2 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse6) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse6))) (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse7 0) (<= 0 .cse7) (not (= 1 ~pended~0)) (<= (+ .cse8 1) 0) (<= 1 ~setEventCalled~0) (= ~s~0 ~NP~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1)))))) [2019-09-16 16:17:22,608 INFO L439 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse0 (not (= 0 ~routine~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse3 (not (= 1 ~pended~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (and .cse3 (= ~s~0 ~NP~0)) .cse4 .cse5) (or (let ((.cse6 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse7 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= .cse6 0) (<= 0 .cse6) .cse3 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse7) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse7 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (let ((.cse8 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse9 .cse1 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse8) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse8)))) (or .cse0 .cse9 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (and .cse3 (= ~SKIP1~0 ~s~0))))) [2019-09-16 16:17:22,609 INFO L439 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse1 .cse2 .cse3 (not (<= 1 ~compRegistered~0)) .cse5 .cse6) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)))) (.cse4 (not (= ~compRegistered~0 0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse0) (or .cse1 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5 .cse6)))) [2019-09-16 16:17:22,609 INFO L443 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2019-09-16 16:17:22,609 INFO L439 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse0 (not (= 0 ~routine~0))) (.cse2 (= 1 |old(~pended~0)|)) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or (and (not (= 1 ~pended~0)) (= 1 ~s~0)) (let ((.cse6 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse1 .cse2 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse6) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse6)))) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5))) [2019-09-16 16:17:22,609 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse0 (not (= 0 ~routine~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse3 (not (= 1 ~pended~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (and .cse3 (= ~s~0 ~NP~0)) .cse4 .cse5) (or (and .cse3 (= 1 ~s~0)) (let ((.cse6 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse7 .cse1 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse6) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse6)))) (or .cse0 .cse7 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (and .cse3 (= ~SKIP1~0 ~s~0))))) [2019-09-16 16:17:22,609 INFO L443 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2019-09-16 16:17:22,609 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2019-09-16 16:17:22,610 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2019-09-16 16:17:22,610 INFO L443 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2019-09-16 16:17:22,610 INFO L439 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse0 (not (= 0 ~routine~0))) (.cse15 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse3 (not (= 1 ~pended~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (and .cse3 (= ~s~0 ~NP~0)) .cse4 .cse5) (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse6 (= ~s~0 ~MPR1~0)) (.cse7 (<= .cse17 0)) (.cse8 (<= 0 .cse17)) (.cse9 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494))) (.cse10 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (<= (+ .cse16 1) 0)) (.cse12 (<= 1 ~setEventCalled~0)) (.cse13 (<= ~setEventCalled~0 1))) (or (and .cse6 .cse7 (= 259 IofCallDriver_~returnVal2~0) .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (and .cse3 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (and .cse3 (= 0 IofCallDriver_~returnVal2~0))) .cse12 .cse13) (let ((.cse14 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse15 .cse1 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse14) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse14)))))) (or .cse0 .cse15 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (and .cse3 (= ~SKIP1~0 ~s~0))))) [2019-09-16 16:17:22,610 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2019-09-16 16:17:22,610 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2019-09-16 16:17:22,610 INFO L443 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2019-09-16 16:17:22,611 INFO L439 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse0 (not (= 0 ~routine~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse3 (not (= 1 ~pended~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (and .cse3 (= ~s~0 ~NP~0)) .cse4 .cse5) (or (let ((.cse6 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse7 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= .cse6 0) (<= 0 .cse6) .cse3 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse7) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse7 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (let ((.cse8 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse9 .cse1 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse8) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse8)))) (or .cse0 .cse9 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (and .cse3 (= ~SKIP1~0 ~s~0))))) [2019-09-16 16:17:22,611 INFO L443 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2019-09-16 16:17:22,611 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2019-09-16 16:17:22,611 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2019-09-16 16:17:22,611 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2019-09-16 16:17:22,611 INFO L443 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2019-09-16 16:17:22,612 INFO L439 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse0 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse1 .cse2 .cse3 (not (<= 1 ~compRegistered~0)) .cse5 .cse6) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)))) (.cse4 (not (= ~compRegistered~0 0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse0) (or .cse1 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5 .cse6)))) [2019-09-16 16:17:22,612 INFO L443 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2019-09-16 16:17:22,612 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2019-09-16 16:17:22,612 INFO L439 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse0 (not (= 0 ~routine~0))) (.cse9 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse3 (not (= 1 ~pended~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (and .cse3 (= ~s~0 ~NP~0)) .cse4 .cse5) (or (let ((.cse6 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse7 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= .cse6 0) (<= 0 .cse6) .cse3 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse7) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse7 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (let ((.cse8 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (or (or .cse0 .cse9 .cse1 (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (<= (+ ~MPR3~0 1) ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) (and (or (not (= ~myStatus~0 0)) .cse8) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse8)))) (or .cse0 .cse9 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5 (and .cse3 (= ~SKIP1~0 ~s~0))))) [2019-09-16 16:17:22,612 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2019-09-16 16:17:22,612 INFO L443 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2019-09-16 16:17:22,612 INFO L446 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2019-09-16 16:17:22,613 INFO L446 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2019-09-16 16:17:22,613 INFO L443 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2019-09-16 16:17:22,614 INFO L439 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (not (= DiskPerfDispatchPnp_~status~0 259)) (= 0 ~routine~0) (= ~s~0 ~DC~0) (<= 1 ~compRegistered~0) (not (= 1 ~pended~0)))) [2019-09-16 16:17:22,614 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-16 16:17:22,614 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2019-09-16 16:17:22,614 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-09-16 16:17:22,614 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2019-09-16 16:17:22,614 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-16 16:17:22,615 INFO L439 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0))) [2019-09-16 16:17:22,615 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (and (= ~myStatus~0 0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2019-09-16 16:17:22,615 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2019-09-16 16:17:22,615 INFO L439 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,615 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~MPR3~0 1) ~IPC~0))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-16 16:17:22,615 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2019-09-16 16:17:22,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:17:22,616 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-09-16 16:17:22,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:17:22,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:17:22,616 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) (= ~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) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-09-16 16:17:22,616 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:17:22,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:17:22,616 INFO L439 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,617 INFO L443 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2019-09-16 16:17:22,617 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2019-09-16 16:17:22,617 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2019-09-16 16:17:22,617 INFO L439 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 435 452) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-09-16 16:17:22,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:17:22 BoogieIcfgContainer [2019-09-16 16:17:22,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:17:22,687 INFO L168 Benchmark]: Toolchain (without parser) took 60950.57 ms. Allocated memory was 141.6 MB in the beginning and 812.1 MB in the end (delta: 670.6 MB). Free memory was 86.8 MB in the beginning and 106.2 MB in the end (delta: -19.4 MB). Peak memory consumption was 663.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,688 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.45 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 86.6 MB in the beginning and 170.6 MB in the end (delta: -84.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,689 INFO L168 Benchmark]: Boogie Preprocessor took 136.38 ms. Allocated memory is still 202.4 MB. Free memory was 170.6 MB in the beginning and 166.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,689 INFO L168 Benchmark]: RCFGBuilder took 1152.86 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 166.6 MB in the beginning and 200.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,690 INFO L168 Benchmark]: TraceAbstraction took 59025.25 ms. Allocated memory was 230.2 MB in the beginning and 812.1 MB in the end (delta: 582.0 MB). Free memory was 200.3 MB in the beginning and 106.2 MB in the end (delta: 94.1 MB). Peak memory consumption was 688.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:17:22,693 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.19 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 631.45 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 86.6 MB in the beginning and 170.6 MB in the end (delta: -84.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.38 ms. Allocated memory is still 202.4 MB. Free memory was 170.6 MB in the beginning and 166.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1152.86 ms. Allocated memory was 202.4 MB in the beginning and 230.2 MB in the end (delta: 27.8 MB). Free memory was 166.6 MB in the beginning and 200.3 MB in the end (delta: -33.7 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59025.25 ms. Allocated memory was 230.2 MB in the beginning and 812.1 MB in the end (delta: 582.0 MB). Free memory was 200.3 MB in the beginning and 106.2 MB in the end (delta: 94.1 MB). Peak memory consumption was 688.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 1000]: Loop Invariant Derived loop invariant: (((((1 == s && \old(customIrp) == customIrp) || ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) || !(myStatus == 0)) && ((1 == s && \old(customIrp) == customIrp) || !(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1))) && ((((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || (((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(myStatus + 1073741637 <= 0) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1))) && (((!(myStatus == 0) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1)) || (((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || ((!(1 == pended) && status == 0) && s == DC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && status + 1073741789 <= 0)) || !(\old(compRegistered) == 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(status == 259))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((s == IPC && !(1 == pended)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || (((((((s == SKIP2 && !(1 == pended)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((!(1 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && 0 == routine)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s) - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: (((((1 == s && \old(customIrp) == customIrp) || ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) || !(myStatus == 0)) && ((1 == s && \old(customIrp) == customIrp) || !(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1))) && ((((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || (((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(myStatus + 1073741637 <= 0) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1))) && (((!(myStatus == 0) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1)) || (((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 0 == routine) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && (((((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && !(1 == pended)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || ((!(myStatus == 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s))) && (!(myStatus + 1073741637 <= 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s)))))) && (((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s)) - InvariantResult [Line: 845]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: (((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) || !(myStatus == 0)) && (!(myStatus + 1073741637 <= 0) || ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || (!(1 <= compRegistered) || (!(0 == routine) || 1 == pended) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1))) && (((!(myStatus == 0) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1)) && (!(myStatus + 1073741637 <= 0) || (((((((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == routine)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(MPR3 + 1 <= IPC)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1))) || (((1 == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) || (((((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && DC + 1073742084 <= s)) || ((!(1 == pended) && status == 0) && s == DC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && (((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) || (((((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || ((((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) || (((((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) && (DC + 1073742087 <= s || !(status == 259)))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || ((((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) || (((((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) && IPC <= s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && (((((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && !(1 == pended)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || ((!(myStatus == 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s))) && (!(myStatus + 1073741637 <= 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s)))))) && (((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s)) - InvariantResult [Line: 716]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 4 <= MPR1) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == routine) && NP + 4 <= MPR1) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MPR3 + 1 <= IPC)) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 843]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((s == SKIP2 && DC + 5 <= IPC) && !(1 == pended)) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || ((!(1 == pended) && status == 0) && s == DC)) || (((((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((s == IPC && DC + 5 <= IPC) && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((!(1 == pended) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && !(status == 259))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || ((!(1 == pended) && status == 0) && s == DC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || (((((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && status + 1073741789 <= 0)) || !(\old(compRegistered) == 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && !(1 == pended)) && DC + 2 <= SKIP2) && 0 == routine) && s == DC) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(status == 259))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((s == IPC && !(1 == pended)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || (((((((s == SKIP2 && !(1 == pended)) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && (((((((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 259 == returnVal2) && 0 <= compRetStatus + 1073741802) && !(1 == pended)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || ((((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && ((!(1 == pended) && returnVal2 + 1073741823 <= 0) || (!(1 == pended) && 0 == returnVal2))) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((!(myStatus == 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s))) && (!(myStatus + 1073741637 <= 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s)))))) && (((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) + 1073741637 <= 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) && ((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) || (((!(1 == pended) && 0 == compRegistered) && s == \old(s)) && 0 == routine) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) + 1073741637 <= 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) && ((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) || ((((((myStatus == 0 && 0 == compRegistered) && 0 == routine) && !(1 == pended)) && 1 == s) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((!(1 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 0 == routine)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) + 1073741637 <= 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) && ((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) || ((((!(status == 259) && 0 == routine) && s == DC) && 1 <= compRegistered) && !(1 == pended)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((0 == compRegistered && 0 == routine) && !(1 == pended)) && 1 == s) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || (((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) + 1073741637 <= 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) && ((((((((((((!(NP + 5 <= MPR3) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(0 == \old(routine))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || !(MPR3 + 1 <= IPC)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || ((!(1 == pended) && s == NP) && 0 == compRegistered)) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: (((((((!(0 == routine) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || (!(1 == pended) && s == NP)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && (((((((((s == MPR1 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && !(1 == pended)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || ((!(myStatus == 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s))) && (!(myStatus + 1073741637 <= 0) || ((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 == \old(s)))))) && (((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s)) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (!(1 == pended) && SKIP1 == s) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: (!(1 == pended) && 1 == s) || ((((((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || !(myStatus == 0)) && (((((((!(NP + 5 <= MPR3) || (((((!(0 == routine) || !(SKIP1 + 2 <= MPR1)) || 1 == \old(pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MPR3 + 1 <= IPC)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(\old(customIrp) == 0)) || !(1 == \old(s))) || !(myStatus + 1073741637 <= 0))) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((!(1 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && 0 == routine)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 295 locations, 1 error locations. SAFE Result, 58.8s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 30.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 14609 SDtfs, 9521 SDslu, 42300 SDs, 0 SdLazy, 20257 SolverSat, 2203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 296 SyntacticMatches, 14 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 2494 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4861 PreInvPairs, 5119 NumberOfFragments, 13470 HoareAnnotationTreeSize, 4861 FomulaSimplifications, 329239 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 109 FomulaSimplificationsInter, 244069 FormulaSimplificationTreeSizeReductionInter, 27.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3658 NumberOfCodeBlocks, 3658 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 3608 ConstructedInterpolants, 0 QuantifiedInterpolants, 549604 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 50 InterpolantComputations, 49 PerfectInterpolantSequences, 640/646 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...