./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 564a601a6273fd55bda5923edf4b35a694c899ec ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:57:51,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:57:51,585 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:57:51,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:57:51,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:57:51,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:57:51,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:57:51,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:57:51,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:57:51,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:57:51,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:57:51,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:57:51,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:57:51,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:57:51,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:57:51,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:57:51,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:57:51,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:57:51,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:57:51,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:57:51,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:57:51,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:57:51,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:57:51,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:57:51,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:57:51,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:57:51,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:57:51,615 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:57:51,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:57:51,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:57:51,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:57:51,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:57:51,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:57:51,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:57:51,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:57:51,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:57:51,618 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:57:51,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:57:51,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:57:51,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:57:51,627 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:57:51,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:57:51,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:57:51,628 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:57:51,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:57:51,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:57:51,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:57:51,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:57:51,629 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:57:51,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:57:51,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:57:51,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:57:51,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:57:51,630 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:57:51,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:51,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:57:51,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:57:51,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:57:51,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:57:51,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:57:51,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:57:51,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-11-22 21:57:51,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:57:51,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:57:51,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:57:51,673 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:57:51,674 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:57:51,674 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-22 21:57:51,725 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/data/3a31f2c65/2668123339fc46a4a66c5dfd81d9ed73/FLAG4ce417067 [2018-11-22 21:57:52,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:57:52,101 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-22 21:57:52,111 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/data/3a31f2c65/2668123339fc46a4a66c5dfd81d9ed73/FLAG4ce417067 [2018-11-22 21:57:52,495 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/data/3a31f2c65/2668123339fc46a4a66c5dfd81d9ed73 [2018-11-22 21:57:52,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:57:52,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:57:52,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:52,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:57:52,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:57:52,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b7276d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52, skipping insertion in model container [2018-11-22 21:57:52,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:57:52,549 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:57:52,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:52,783 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:57:52,860 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:52,880 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:57:52,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52 WrapperNode [2018-11-22 21:57:52,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:52,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:52,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:57:52,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:57:52,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:52,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:57:52,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:57:52,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:57:52,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:52,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:53,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:53,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... [2018-11-22 21:57:53,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:57:53,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:57:53,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:57:53,017 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:57:53,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:53,066 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-22 21:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-22 21:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-22 21:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-22 21:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-22 21:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-22 21:57:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-22 21:57:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-22 21:57:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-22 21:57:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-22 21:57:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-22 21:57:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-22 21:57:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-22 21:57:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-22 21:57:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-22 21:57:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-22 21:57:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-22 21:57:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-22 21:57:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-22 21:57:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-22 21:57:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-22 21:57:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-22 21:57:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-22 21:57:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-22 21:57:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-22 21:57:53,072 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-22 21:57:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-22 21:57:53,072 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-22 21:57:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-22 21:57:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-22 21:57:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-22 21:57:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-11-22 21:57:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-11-22 21:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:57:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:57:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-22 21:57:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-22 21:57:53,299 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,300 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,460 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,460 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,547 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,547 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,574 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,574 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,761 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,761 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,838 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 21:57:53,838 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 21:57:53,875 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:57:53,875 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:57:53,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:53 BoogieIcfgContainer [2018-11-22 21:57:53,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:57:53,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:57:53,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:57:53,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:57:53,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:57:52" (1/3) ... [2018-11-22 21:57:53,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea07d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:53, skipping insertion in model container [2018-11-22 21:57:53,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:52" (2/3) ... [2018-11-22 21:57:53,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea07d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:53, skipping insertion in model container [2018-11-22 21:57:53,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:53" (3/3) ... [2018-11-22 21:57:53,884 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-22 21:57:53,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:57:53,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:57:53,917 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:57:53,950 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:57:53,951 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:57:53,951 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:57:53,951 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:57:53,952 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:57:53,952 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:57:53,952 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:57:53,952 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:57:53,952 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:57:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-11-22 21:57:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:57:53,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:53,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:53,988 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:53,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-11-22 21:57:53,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:54,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:54,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,192 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-11-22 21:57:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:54,350 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-11-22 21:57:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:54,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 21:57:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:54,365 INFO L225 Difference]: With dead ends: 537 [2018-11-22 21:57:54,365 INFO L226 Difference]: Without dead ends: 287 [2018-11-22 21:57:54,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-22 21:57:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-22 21:57:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-22 21:57:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-11-22 21:57:54,428 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-11-22 21:57:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:54,429 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-11-22 21:57:54,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-11-22 21:57:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:57:54,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:54,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:54,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-11-22 21:57:54,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:54,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:54,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:54,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:54,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:54,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,549 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-11-22 21:57:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:54,717 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-11-22 21:57:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:54,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:57:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:54,728 INFO L225 Difference]: With dead ends: 637 [2018-11-22 21:57:54,728 INFO L226 Difference]: Without dead ends: 454 [2018-11-22 21:57:54,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-11-22 21:57:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-11-22 21:57:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-22 21:57:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-11-22 21:57:54,774 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-11-22 21:57:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:54,774 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-11-22 21:57:54,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-11-22 21:57:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:57:54,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:54,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:54,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:54,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-11-22 21:57:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:54,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,848 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-11-22 21:57:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:54,907 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-11-22 21:57:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:54,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:57:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:54,914 INFO L225 Difference]: With dead ends: 963 [2018-11-22 21:57:54,914 INFO L226 Difference]: Without dead ends: 646 [2018-11-22 21:57:54,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-22 21:57:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-11-22 21:57:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-22 21:57:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-11-22 21:57:54,960 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-11-22 21:57:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:54,960 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-11-22 21:57:54,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-11-22 21:57:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:57:54,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:54,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:54,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:54,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-11-22 21:57:54,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:54,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:54,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:55,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,039 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-11-22 21:57:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:55,130 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-11-22 21:57:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:55,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-22 21:57:55,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:55,135 INFO L225 Difference]: With dead ends: 621 [2018-11-22 21:57:55,135 INFO L226 Difference]: Without dead ends: 617 [2018-11-22 21:57:55,135 INFO L631 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 [2018-11-22 21:57:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-22 21:57:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-11-22 21:57:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-22 21:57:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-11-22 21:57:55,165 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-11-22 21:57:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:55,165 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-11-22 21:57:55,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-11-22 21:57:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-22 21:57:55,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:55,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:55,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:55,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-11-22 21:57:55,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:55,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,218 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-11-22 21:57:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:55,289 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-11-22 21:57:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:55,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-22 21:57:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:55,297 INFO L225 Difference]: With dead ends: 1072 [2018-11-22 21:57:55,297 INFO L226 Difference]: Without dead ends: 1053 [2018-11-22 21:57:55,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-11-22 21:57:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-11-22 21:57:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-22 21:57:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-11-22 21:57:55,340 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-11-22 21:57:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:55,340 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-11-22 21:57:55,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-11-22 21:57:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-22 21:57:55,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:55,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:55,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:55,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-11-22 21:57:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:55,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:55,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,384 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-11-22 21:57:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:55,463 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-11-22 21:57:55,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:55,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-22 21:57:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:55,468 INFO L225 Difference]: With dead ends: 1050 [2018-11-22 21:57:55,468 INFO L226 Difference]: Without dead ends: 1045 [2018-11-22 21:57:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-11-22 21:57:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-11-22 21:57:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-11-22 21:57:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-11-22 21:57:55,501 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-11-22 21:57:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:55,502 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-11-22 21:57:55,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-11-22 21:57:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 21:57:55,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:55,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:55,503 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:55,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-11-22 21:57:55,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:57:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:55,553 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-11-22 21:57:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:55,592 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-11-22 21:57:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:57:55,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-22 21:57:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:55,596 INFO L225 Difference]: With dead ends: 1058 [2018-11-22 21:57:55,597 INFO L226 Difference]: Without dead ends: 1036 [2018-11-22 21:57:55,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-22 21:57:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-11-22 21:57:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-22 21:57:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-11-22 21:57:55,631 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-11-22 21:57:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:55,631 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-11-22 21:57:55,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-11-22 21:57:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-22 21:57:55,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:55,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:55,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:55,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-11-22 21:57:55,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:55,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,693 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-11-22 21:57:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:55,726 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-11-22 21:57:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:55,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-22 21:57:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:55,729 INFO L225 Difference]: With dead ends: 1448 [2018-11-22 21:57:55,729 INFO L226 Difference]: Without dead ends: 578 [2018-11-22 21:57:55,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:55,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-22 21:57:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-11-22 21:57:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-22 21:57:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-11-22 21:57:55,754 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-11-22 21:57:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:55,754 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-11-22 21:57:55,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-11-22 21:57:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 21:57:55,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:55,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:55,755 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:55,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-11-22 21:57:55,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:55,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:57:55,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:55,810 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-11-22 21:57:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:56,095 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-11-22 21:57:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:57:56,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-22 21:57:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:56,100 INFO L225 Difference]: With dead ends: 586 [2018-11-22 21:57:56,100 INFO L226 Difference]: Without dead ends: 580 [2018-11-22 21:57:56,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:57:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-22 21:57:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-22 21:57:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-22 21:57:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-11-22 21:57:56,122 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-11-22 21:57:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:56,122 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-11-22 21:57:56,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-11-22 21:57:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-22 21:57:56,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:56,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:56,124 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:56,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-11-22 21:57:56,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:56,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:56,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:56,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:57:56,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:56,169 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-11-22 21:57:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:56,436 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-11-22 21:57:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:57:56,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-22 21:57:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:56,439 INFO L225 Difference]: With dead ends: 586 [2018-11-22 21:57:56,439 INFO L226 Difference]: Without dead ends: 580 [2018-11-22 21:57:56,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:57:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-22 21:57:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-22 21:57:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-22 21:57:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-11-22 21:57:56,463 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-11-22 21:57:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:56,463 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-11-22 21:57:56,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-11-22 21:57:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-22 21:57:56,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:56,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:56,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:56,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-11-22 21:57:56,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:56,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:56,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:57:56,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:57:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:57:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:57:56,525 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-11-22 21:57:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:56,570 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-11-22 21:57:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:57:56,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-22 21:57:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:56,573 INFO L225 Difference]: With dead ends: 601 [2018-11-22 21:57:56,573 INFO L226 Difference]: Without dead ends: 576 [2018-11-22 21:57:56,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-22 21:57:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-11-22 21:57:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-22 21:57:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-11-22 21:57:56,596 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-11-22 21:57:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:56,597 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-11-22 21:57:56,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:57:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-11-22 21:57:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-22 21:57:56,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:56,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:56,598 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:56,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-11-22 21:57:56,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:56,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:56,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:56,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:56,645 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-11-22 21:57:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:56,745 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-11-22 21:57:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:56,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-22 21:57:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:56,749 INFO L225 Difference]: With dead ends: 810 [2018-11-22 21:57:56,749 INFO L226 Difference]: Without dead ends: 802 [2018-11-22 21:57:56,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-22 21:57:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-11-22 21:57:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-22 21:57:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-11-22 21:57:56,780 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-11-22 21:57:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:56,781 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-11-22 21:57:56,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-11-22 21:57:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 21:57:56,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:56,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:56,783 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:56,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-11-22 21:57:56,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:56,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:56,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:57:56,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:57:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:57:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:57:56,846 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-11-22 21:57:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:56,987 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-11-22 21:57:56,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:57:56,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-22 21:57:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:56,990 INFO L225 Difference]: With dead ends: 719 [2018-11-22 21:57:56,990 INFO L226 Difference]: Without dead ends: 452 [2018-11-22 21:57:56,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:57:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-22 21:57:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-11-22 21:57:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-22 21:57:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-11-22 21:57:57,009 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-11-22 21:57:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:57,009 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-11-22 21:57:57,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:57:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-11-22 21:57:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-22 21:57:57,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:57,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:57,010 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-11-22 21:57:57,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:57,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:57,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:57:57,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:57:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:57:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:57:57,075 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-11-22 21:57:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:57,194 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-11-22 21:57:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:57:57,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-22 21:57:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:57,197 INFO L225 Difference]: With dead ends: 447 [2018-11-22 21:57:57,197 INFO L226 Difference]: Without dead ends: 443 [2018-11-22 21:57:57,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:57:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-22 21:57:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-11-22 21:57:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-11-22 21:57:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-11-22 21:57:57,213 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-11-22 21:57:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:57,214 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-11-22 21:57:57,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:57:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-11-22 21:57:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-22 21:57:57,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:57,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:57,215 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:57,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-11-22 21:57:57,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:57,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:57,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:57,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:57:57,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:57:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:57:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:57:57,267 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-11-22 21:57:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:57,338 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-11-22 21:57:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:57:57,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-22 21:57:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:57,341 INFO L225 Difference]: With dead ends: 760 [2018-11-22 21:57:57,341 INFO L226 Difference]: Without dead ends: 462 [2018-11-22 21:57:57,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:57:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-22 21:57:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-11-22 21:57:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-22 21:57:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-11-22 21:57:57,382 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-11-22 21:57:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:57,382 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-11-22 21:57:57,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:57:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-11-22 21:57:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 21:57:57,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:57,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:57,383 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:57,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-11-22 21:57:57,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:57,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:57,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:57,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:57,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:57,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:57:57,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:57,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:57,423 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-11-22 21:57:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:57,776 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-11-22 21:57:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:57:57,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-22 21:57:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:57,779 INFO L225 Difference]: With dead ends: 580 [2018-11-22 21:57:57,779 INFO L226 Difference]: Without dead ends: 561 [2018-11-22 21:57:57,779 INFO L631 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 [2018-11-22 21:57:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-22 21:57:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-11-22 21:57:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-22 21:57:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-11-22 21:57:57,801 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-11-22 21:57:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:57,801 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-11-22 21:57:57,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:57:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-11-22 21:57:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 21:57:57,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:57,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:57,802 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:57,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-11-22 21:57:57,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:57,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:57,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:57,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:57,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:57:57,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:57:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:57:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:57:57,859 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-11-22 21:57:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:57,963 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-11-22 21:57:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:57:57,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-22 21:57:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:57,965 INFO L225 Difference]: With dead ends: 448 [2018-11-22 21:57:57,965 INFO L226 Difference]: Without dead ends: 417 [2018-11-22 21:57:57,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:57:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-22 21:57:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-22 21:57:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-22 21:57:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-11-22 21:57:57,983 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-11-22 21:57:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:57,983 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-11-22 21:57:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:57:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-11-22 21:57:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 21:57:57,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:57,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:57,985 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:57,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-11-22 21:57:57,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:57,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:58,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:58,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:57:58,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:57:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:57:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:57:58,028 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-11-22 21:57:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:58,064 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-11-22 21:57:58,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:57:58,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-22 21:57:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:58,066 INFO L225 Difference]: With dead ends: 432 [2018-11-22 21:57:58,066 INFO L226 Difference]: Without dead ends: 399 [2018-11-22 21:57:58,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-22 21:57:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-11-22 21:57:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-22 21:57:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-11-22 21:57:58,082 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-11-22 21:57:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:58,082 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-11-22 21:57:58,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:57:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-22 21:57:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 21:57:58,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:58,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:58,084 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:58,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-11-22 21:57:58,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:58,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:57:58,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:57:58,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:57:58,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:57:58,141 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-11-22 21:57:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:58,229 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-11-22 21:57:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:57:58,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-22 21:57:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:58,231 INFO L225 Difference]: With dead ends: 429 [2018-11-22 21:57:58,231 INFO L226 Difference]: Without dead ends: 408 [2018-11-22 21:57:58,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:57:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-22 21:57:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-11-22 21:57:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-22 21:57:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-11-22 21:57:58,249 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-11-22 21:57:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:58,249 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-11-22 21:57:58,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:57:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-11-22 21:57:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-22 21:57:58,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:58,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:58,250 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:58,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-11-22 21:57:58,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:58,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:58,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:57:58,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:57:58,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:57:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:57:58,296 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-11-22 21:57:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:58,324 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-11-22 21:57:58,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:57:58,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-22 21:57:58,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:58,326 INFO L225 Difference]: With dead ends: 436 [2018-11-22 21:57:58,326 INFO L226 Difference]: Without dead ends: 410 [2018-11-22 21:57:58,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-22 21:57:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-11-22 21:57:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-22 21:57:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-22 21:57:58,344 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-11-22 21:57:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:58,344 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-22 21:57:58,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:57:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-22 21:57:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-22 21:57:58,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:58,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:58,345 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:58,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-11-22 21:57:58,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:57:58,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:57:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:57:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:57:58,400 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-11-22 21:57:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:58,854 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-11-22 21:57:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:57:58,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-22 21:57:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:58,858 INFO L225 Difference]: With dead ends: 565 [2018-11-22 21:57:58,858 INFO L226 Difference]: Without dead ends: 511 [2018-11-22 21:57:58,859 INFO L631 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 [2018-11-22 21:57:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-22 21:57:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-11-22 21:57:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-22 21:57:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-11-22 21:57:58,899 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-11-22 21:57:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:58,899 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-11-22 21:57:58,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:57:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-11-22 21:57:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-22 21:57:58,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:58,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:58,901 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:58,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-11-22 21:57:58,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:58,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:58,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:58,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:58,949 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-11-22 21:57:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:59,135 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-11-22 21:57:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-22 21:57:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:59,139 INFO L225 Difference]: With dead ends: 673 [2018-11-22 21:57:59,139 INFO L226 Difference]: Without dead ends: 659 [2018-11-22 21:57:59,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-22 21:57:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-11-22 21:57:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-22 21:57:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-11-22 21:57:59,187 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-11-22 21:57:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:59,187 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-11-22 21:57:59,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-11-22 21:57:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-22 21:57:59,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:59,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:59,189 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:59,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-11-22 21:57:59,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:59,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:59,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:59,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:59,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 21:57:59,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:57:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:57:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:57:59,280 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-11-22 21:57:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:59,361 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-11-22 21:57:59,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:57:59,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-22 21:57:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:59,365 INFO L225 Difference]: With dead ends: 598 [2018-11-22 21:57:59,365 INFO L226 Difference]: Without dead ends: 574 [2018-11-22 21:57:59,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:57:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-22 21:57:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-22 21:57:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-22 21:57:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-11-22 21:57:59,412 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-11-22 21:57:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:59,412 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-11-22 21:57:59,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:57:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-11-22 21:57:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-22 21:57:59,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:59,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:59,413 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:59,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-11-22 21:57:59,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:57:59,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:57:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:59,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:57:59,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:57:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:57:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:57:59,480 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-11-22 21:58:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:00,137 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-11-22 21:58:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:58:00,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-22 21:58:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:00,143 INFO L225 Difference]: With dead ends: 660 [2018-11-22 21:58:00,143 INFO L226 Difference]: Without dead ends: 624 [2018-11-22 21:58:00,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-22 21:58:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-11-22 21:58:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-22 21:58:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-22 21:58:00,195 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-11-22 21:58:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-22 21:58:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:58:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-11-22 21:58:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-22 21:58:00,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:00,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:00,197 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:00,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-11-22 21:58:00,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:00,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:00,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:00,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:58:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:58:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:58:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:58:00,247 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-11-22 21:58:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:00,374 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-11-22 21:58:00,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:58:00,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-22 21:58:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:00,378 INFO L225 Difference]: With dead ends: 955 [2018-11-22 21:58:00,379 INFO L226 Difference]: Without dead ends: 527 [2018-11-22 21:58:00,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:58:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-22 21:58:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-11-22 21:58:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-22 21:58:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-11-22 21:58:00,443 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-11-22 21:58:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:00,444 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-11-22 21:58:00,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:58:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-11-22 21:58:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 21:58:00,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:00,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:00,445 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-11-22 21:58:00,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-22 21:58:00,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 21:58:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 21:58:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 21:58:00,577 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-11-22 21:58:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:00,866 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-11-22 21:58:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:58:00,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-22 21:58:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:00,869 INFO L225 Difference]: With dead ends: 529 [2018-11-22 21:58:00,869 INFO L226 Difference]: Without dead ends: 466 [2018-11-22 21:58:00,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:58:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-22 21:58:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-22 21:58:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-22 21:58:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-11-22 21:58:00,906 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-11-22 21:58:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:00,906 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-11-22 21:58:00,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 21:58:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-11-22 21:58:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-22 21:58:00,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:00,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:00,907 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-11-22 21:58:00,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:00,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:00,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:00,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:00,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:00,974 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-11-22 21:58:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:01,044 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-11-22 21:58:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:01,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-22 21:58:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:01,048 INFO L225 Difference]: With dead ends: 918 [2018-11-22 21:58:01,048 INFO L226 Difference]: Without dead ends: 491 [2018-11-22 21:58:01,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:58:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-22 21:58:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-11-22 21:58:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-22 21:58:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-11-22 21:58:01,087 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-11-22 21:58:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:01,088 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-11-22 21:58:01,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-11-22 21:58:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-22 21:58:01,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:01,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:01,089 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:01,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-11-22 21:58:01,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:01,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:01,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:58:01,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:58:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:58:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:58:01,149 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-11-22 21:58:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:01,292 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-11-22 21:58:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:58:01,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-22 21:58:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:01,297 INFO L225 Difference]: With dead ends: 730 [2018-11-22 21:58:01,297 INFO L226 Difference]: Without dead ends: 727 [2018-11-22 21:58:01,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:58:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-22 21:58:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-11-22 21:58:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-22 21:58:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-11-22 21:58:01,345 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-11-22 21:58:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:01,346 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-11-22 21:58:01,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:58:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-11-22 21:58:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-22 21:58:01,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:01,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:01,352 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:01,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-11-22 21:58:01,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:01,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:01,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:01,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:01,532 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-11-22 21:58:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:01,602 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-11-22 21:58:01,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:01,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-22 21:58:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:01,606 INFO L225 Difference]: With dead ends: 755 [2018-11-22 21:58:01,606 INFO L226 Difference]: Without dead ends: 312 [2018-11-22 21:58:01,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:58:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-22 21:58:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-22 21:58:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-22 21:58:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-11-22 21:58:01,640 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-11-22 21:58:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:01,640 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-11-22 21:58:01,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-11-22 21:58:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-22 21:58:01,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:01,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:01,641 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:01,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-11-22 21:58:01,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:01,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:01,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:01,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:01,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:58:01,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:58:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:58:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:58:01,703 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-11-22 21:58:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:01,994 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-11-22 21:58:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:58:01,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-22 21:58:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:01,998 INFO L225 Difference]: With dead ends: 579 [2018-11-22 21:58:01,998 INFO L226 Difference]: Without dead ends: 307 [2018-11-22 21:58:02,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:58:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-22 21:58:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-22 21:58:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-22 21:58:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-11-22 21:58:02,033 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-11-22 21:58:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:02,034 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-11-22 21:58:02,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:58:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-11-22 21:58:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 21:58:02,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:02,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:02,035 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:02,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:02,036 INFO L82 PathProgramCache]: Analyzing trace with hash 438765614, now seen corresponding path program 1 times [2018-11-22 21:58:02,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:02,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:02,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:02,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:58:02,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:58:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:58:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:58:02,182 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-11-22 21:58:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:02,767 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-11-22 21:58:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:02,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-22 21:58:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:02,769 INFO L225 Difference]: With dead ends: 669 [2018-11-22 21:58:02,769 INFO L226 Difference]: Without dead ends: 405 [2018-11-22 21:58:02,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:58:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-11-22 21:58:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-11-22 21:58:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-22 21:58:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-11-22 21:58:02,789 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 70 [2018-11-22 21:58:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:02,790 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-11-22 21:58:02,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:58:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-11-22 21:58:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-22 21:58:02,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:02,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:02,791 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:02,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-11-22 21:58:02,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:02,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:02,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:02,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:02,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:02,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:02,848 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-11-22 21:58:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:02,886 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-11-22 21:58:02,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:02,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-22 21:58:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:02,889 INFO L225 Difference]: With dead ends: 691 [2018-11-22 21:58:02,889 INFO L226 Difference]: Without dead ends: 369 [2018-11-22 21:58:02,891 INFO L631 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 [2018-11-22 21:58:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-22 21:58:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-11-22 21:58:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-22 21:58:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-11-22 21:58:02,911 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-11-22 21:58:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:02,911 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-11-22 21:58:02,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-11-22 21:58:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-22 21:58:02,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:02,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:02,913 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:02,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-11-22 21:58:02,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:02,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:02,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:02,969 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-11-22 21:58:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:03,220 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-11-22 21:58:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:58:03,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-22 21:58:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:03,223 INFO L225 Difference]: With dead ends: 642 [2018-11-22 21:58:03,223 INFO L226 Difference]: Without dead ends: 337 [2018-11-22 21:58:03,225 INFO L631 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 [2018-11-22 21:58:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-22 21:58:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-11-22 21:58:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-22 21:58:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-11-22 21:58:03,244 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-11-22 21:58:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:03,245 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-11-22 21:58:03,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-11-22 21:58:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-22 21:58:03,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:03,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:03,246 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:03,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-11-22 21:58:03,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:03,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:03,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:03,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:03,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-22 21:58:03,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 21:58:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 21:58:03,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:58:03,356 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-11-22 21:58:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:03,529 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-11-22 21:58:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:58:03,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-11-22 21:58:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:03,531 INFO L225 Difference]: With dead ends: 626 [2018-11-22 21:58:03,531 INFO L226 Difference]: Without dead ends: 333 [2018-11-22 21:58:03,532 INFO L631 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 [2018-11-22 21:58:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-22 21:58:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-11-22 21:58:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-22 21:58:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-11-22 21:58:03,548 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-11-22 21:58:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:03,548 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-11-22 21:58:03,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 21:58:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-11-22 21:58:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-22 21:58:03,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:03,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:03,550 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:03,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-11-22 21:58:03,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:03,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:03,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:03,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:03,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:03,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-22 21:58:03,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 21:58:03,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:58:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:58:03,651 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-11-22 21:58:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:04,477 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-11-22 21:58:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:58:04,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-22 21:58:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:04,484 INFO L225 Difference]: With dead ends: 364 [2018-11-22 21:58:04,484 INFO L226 Difference]: Without dead ends: 322 [2018-11-22 21:58:04,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-22 21:58:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-22 21:58:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-11-22 21:58:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-22 21:58:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-11-22 21:58:04,512 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-11-22 21:58:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:04,513 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-11-22 21:58:04,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 21:58:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-11-22 21:58:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-22 21:58:04,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:04,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:04,514 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:04,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-11-22 21:58:04,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:04,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:04,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-22 21:58:04,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 21:58:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 21:58:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:58:04,659 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-11-22 21:58:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:04,800 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-11-22 21:58:04,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:58:04,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-11-22 21:58:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:04,803 INFO L225 Difference]: With dead ends: 353 [2018-11-22 21:58:04,804 INFO L226 Difference]: Without dead ends: 326 [2018-11-22 21:58:04,804 INFO L631 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 [2018-11-22 21:58:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-22 21:58:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-11-22 21:58:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-22 21:58:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-11-22 21:58:04,826 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-11-22 21:58:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:04,827 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-11-22 21:58:04,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 21:58:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-11-22 21:58:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-22 21:58:04,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:04,829 INFO L402 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, 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] [2018-11-22 21:58:04,829 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:04,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-11-22 21:58:04,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:04,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:04,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-22 21:58:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:58:04,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:58:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:58:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:58:04,891 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-11-22 21:58:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:05,116 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-11-22 21:58:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:05,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-22 21:58:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:05,119 INFO L225 Difference]: With dead ends: 709 [2018-11-22 21:58:05,119 INFO L226 Difference]: Without dead ends: 447 [2018-11-22 21:58:05,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:58:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-22 21:58:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-11-22 21:58:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-22 21:58:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-11-22 21:58:05,145 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-11-22 21:58:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:05,145 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-11-22 21:58:05,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:58:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-11-22 21:58:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-22 21:58:05,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:05,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:58:05,147 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:05,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-11-22 21:58:05,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:05,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:05,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:58:05,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:05,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-22 21:58:05,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 21:58:05,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:58:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:58:05,272 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-11-22 21:58:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:06,149 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-11-22 21:58:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 21:58:06,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-22 21:58:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:06,151 INFO L225 Difference]: With dead ends: 405 [2018-11-22 21:58:06,152 INFO L226 Difference]: Without dead ends: 341 [2018-11-22 21:58:06,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-22 21:58:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-22 21:58:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-11-22 21:58:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-22 21:58:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-11-22 21:58:06,180 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-11-22 21:58:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:06,180 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-11-22 21:58:06,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 21:58:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-11-22 21:58:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-22 21:58:06,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:06,182 INFO L402 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] [2018-11-22 21:58:06,182 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:06,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:06,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-11-22 21:58:06,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:06,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:06,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-22 21:58:06,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:06,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:06,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:06,266 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-11-22 21:58:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:06,331 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-11-22 21:58:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:06,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-22 21:58:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:06,333 INFO L225 Difference]: With dead ends: 468 [2018-11-22 21:58:06,333 INFO L226 Difference]: Without dead ends: 322 [2018-11-22 21:58:06,334 INFO L631 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 [2018-11-22 21:58:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-22 21:58:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-11-22 21:58:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-22 21:58:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-11-22 21:58:06,364 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-11-22 21:58:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:06,364 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-11-22 21:58:06,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-11-22 21:58:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-22 21:58:06,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:06,366 INFO L402 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] [2018-11-22 21:58:06,366 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:06,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-11-22 21:58:06,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:06,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:06,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-22 21:58:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:58:06,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:58:06,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:58:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-22 21:58:06,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:58:06,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-22 21:58:06,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:58:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:58:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:58:06,731 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 7 states. [2018-11-22 21:58:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:06,804 INFO L93 Difference]: Finished difference Result 425 states and 518 transitions. [2018-11-22 21:58:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:58:06,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2018-11-22 21:58:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:06,807 INFO L225 Difference]: With dead ends: 425 [2018-11-22 21:58:06,807 INFO L226 Difference]: Without dead ends: 279 [2018-11-22 21:58:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-22 21:58:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-22 21:58:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-11-22 21:58:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-22 21:58:06,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2018-11-22 21:58:06,826 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 163 [2018-11-22 21:58:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:06,826 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2018-11-22 21:58:06,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:58:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-11-22 21:58:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-22 21:58:06,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:06,828 INFO L402 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] [2018-11-22 21:58:06,828 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:06,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-11-22 21:58:06,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-22 21:58:06,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:06,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:06,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:06,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:06,907 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 6 states. [2018-11-22 21:58:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:06,945 INFO L93 Difference]: Finished difference Result 435 states and 525 transitions. [2018-11-22 21:58:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:06,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-22 21:58:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:06,948 INFO L225 Difference]: With dead ends: 435 [2018-11-22 21:58:06,948 INFO L226 Difference]: Without dead ends: 303 [2018-11-22 21:58:06,949 INFO L631 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 [2018-11-22 21:58:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-22 21:58:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2018-11-22 21:58:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-22 21:58:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 316 transitions. [2018-11-22 21:58:06,966 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 316 transitions. Word has length 164 [2018-11-22 21:58:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:06,966 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 316 transitions. [2018-11-22 21:58:06,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 316 transitions. [2018-11-22 21:58:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-22 21:58:06,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:06,969 INFO L402 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] [2018-11-22 21:58:06,969 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:06,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-11-22 21:58:06,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:06,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:06,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-22 21:58:07,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:07,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:07,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:07,043 INFO L87 Difference]: Start difference. First operand 270 states and 316 transitions. Second operand 6 states. [2018-11-22 21:58:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:07,080 INFO L93 Difference]: Finished difference Result 326 states and 379 transitions. [2018-11-22 21:58:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:07,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-22 21:58:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:07,083 INFO L225 Difference]: With dead ends: 326 [2018-11-22 21:58:07,083 INFO L226 Difference]: Without dead ends: 255 [2018-11-22 21:58:07,083 INFO L631 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 [2018-11-22 21:58:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-22 21:58:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2018-11-22 21:58:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-22 21:58:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 280 transitions. [2018-11-22 21:58:07,098 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 280 transitions. Word has length 204 [2018-11-22 21:58:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:07,098 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 280 transitions. [2018-11-22 21:58:07,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 280 transitions. [2018-11-22 21:58:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-22 21:58:07,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:58:07,100 INFO L402 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] [2018-11-22 21:58:07,101 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:58:07,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:58:07,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-11-22 21:58:07,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:58:07,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:58:07,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:58:07,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:58:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:58:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-22 21:58:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:58:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:58:07,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:58:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:58:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:58:07,189 INFO L87 Difference]: Start difference. First operand 241 states and 280 transitions. Second operand 6 states. [2018-11-22 21:58:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:58:07,228 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2018-11-22 21:58:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:58:07,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-11-22 21:58:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:58:07,230 INFO L225 Difference]: With dead ends: 241 [2018-11-22 21:58:07,230 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:58:07,231 INFO L631 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 [2018-11-22 21:58:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:58:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:58:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:58:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:58:07,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-22 21:58:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:58:07,232 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:58:07,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:58:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:58:07,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:58:07,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:58:07,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:07,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 21:58:08,407 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-11-22 21:58:08,613 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2018-11-22 21:58:09,023 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2018-11-22 21:58:09,184 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-11-22 21:58:09,315 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-22 21:58:09,969 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-11-22 21:58:10,089 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-22 21:58:10,417 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-22 21:58:10,651 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2018-11-22 21:58:11,426 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-22 21:58:11,891 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-11-22 21:58:12,179 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-22 21:58:12,396 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2018-11-22 21:58:12,683 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2018-11-22 21:58:13,072 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2018-11-22 21:58:13,357 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-22 21:58:13,651 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-22 21:58:13,837 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-22 21:58:13,989 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-22 21:58:14,129 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2018-11-22 21:58:14,791 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-22 21:58:14,877 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-11-22 21:58:14,877 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (or (= 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 (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,877 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-11-22 21:58:14,877 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-11-22 21:58:14,877 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-11-22 21:58:14,877 INFO L444 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,878 INFO L444 ceAbstractionStarter]: At program point L787(lines 780 828) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,878 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-11-22 21:58:14,878 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-11-22 21:58:14,878 INFO L444 ceAbstractionStarter]: At program point L779(lines 772 829) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,878 INFO L444 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L444 ceAbstractionStarter]: At program point L722(lines 721 762) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L444 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-11-22 21:58:14,879 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (or (= 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 (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (or (= 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 (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (or (= 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 (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L444 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-11-22 21:58:14,880 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L444 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~0)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,881 INFO L444 ceAbstractionStarter]: At program point L727(lines 726 761) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L444 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L444 ceAbstractionStarter]: At program point L712(lines 711 764) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,881 INFO L444 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse2 (= ~DC~0 ~s~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (not (= ~pended~0 1)))) (let ((.cse7 (= 0 main_~status~6)) (.cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse4 .cse5 .cse6 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and (and (<= 1 ~NP~0) .cse0 (<= ~NP~0 1) .cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (<= ~IPC~0 ~s~0) .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse2 .cse6) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-22 21:58:14,881 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-11-22 21:58:14,881 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (= ~myStatus~0 259) (< ~setEventCalled~0 1) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (and (<= 1 ~s~0) (<= ~s~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (= ~myStatus~0 259) (< ~setEventCalled~0 1) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point L1055(lines 1054 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point L1027(line 1027) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point L1048(lines 1047 1070) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,882 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 1015 1099) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,883 INFO L444 ceAbstractionStarter]: At program point L1040(line 1040) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,883 INFO L444 ceAbstractionStarter]: At program point L1032(line 1032) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L444 ceAbstractionStarter]: At program point L1053(lines 1052 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-11-22 21:58:14,883 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L444 ceAbstractionStarter]: At program point L1067(lines 1023 1098) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L444 ceAbstractionStarter]: At program point L1092(line 1092) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L444 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-11-22 21:58:14,884 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-11-22 21:58:14,885 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 211 235) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,885 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,885 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-22 21:58:14,885 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-11-22 21:58:14,885 INFO L444 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-11-22 21:58:14,885 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-11-22 21:58:14,885 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-11-22 21:58:14,885 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L444 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-11-22 21:58:14,886 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-11-22 21:58:14,886 INFO L444 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse7 (= ~myStatus~0 259)) (.cse10 (<= 1 ~s~0)) (.cse13 (+ ~DC~0 5)) (.cse14 (+ ~SKIP1~0 2))) (let ((.cse6 (< ~MPR1~0 .cse14)) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~compRegistered~0 1)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (= 1 ~pended~0)) (.cse11 (< ~IPC~0 .cse13)) (.cse0 (and (not .cse7) (<= .cse13 ~IPC~0) (= ~s~0 ~NP~0) (<= .cse14 ~MPR1~0) (<= 1 ~compRegistered~0) .cse10 (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse12 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse8 .cse9 (and (= |old(~customIrp~0)| 1) (and .cse10 (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 0 ~customIrp~0)) .cse11 (< |old(~s~0)| 1) .cse12) (or .cse6 .cse7 .cse8 (< ~NP~0 1) (or .cse9 (or .cse5 .cse1 .cse11)) .cse0 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse4 .cse12)))) [2018-11-22 21:58:14,887 INFO L444 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse7 (= ~myStatus~0 259)) (.cse10 (<= 1 ~s~0)) (.cse13 (+ ~DC~0 5)) (.cse14 (+ ~SKIP1~0 2))) (let ((.cse6 (< ~MPR1~0 .cse14)) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~compRegistered~0 1)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (= 1 ~pended~0)) (.cse11 (< ~IPC~0 .cse13)) (.cse0 (and (not .cse7) (<= .cse13 ~IPC~0) (= ~s~0 ~NP~0) (<= .cse14 ~MPR1~0) (<= 1 ~compRegistered~0) .cse10 (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse12 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse8 .cse9 (and (= |old(~customIrp~0)| 1) (and .cse10 (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 0 ~customIrp~0)) .cse11 (< |old(~s~0)| 1) .cse12) (or .cse6 .cse7 .cse8 (< ~NP~0 1) (or .cse9 (or .cse5 .cse1 .cse11)) .cse0 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 .cse4 .cse12)))) [2018-11-22 21:58:14,887 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse11 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (<= 1 ~setEventCalled~0)) (.cse10 (<= ~setEventCalled~0 1)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse13 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 (and (<= 1 ~s~0) (<= ~s~0 1) .cse8 .cse9 .cse10) .cse11 .cse12 (< |old(~s~0)| 1) .cse13) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse11 (or .cse4 .cse0 .cse12)) (and (= ~s~0 ~MPR3~0) .cse8 .cse9 .cse10) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse13))) [2018-11-22 21:58:14,887 INFO L444 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0))) (or (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-22 21:58:14,887 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-22 21:58:14,887 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-11-22 21:58:14,887 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 (= ~s~0 ~NP~0) .cse1 (not (= ~compRegistered~0 0))) (or (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (and (<= 1 ~s~0) (<= ~s~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-22 21:58:14,887 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-11-22 21:58:14,888 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~s~0 1)) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-11-22 21:58:14,888 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-11-22 21:58:14,889 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,889 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-11-22 21:58:14,889 INFO L444 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 186 210) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,889 INFO L444 ceAbstractionStarter]: At program point L206(line 206) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,889 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-11-22 21:58:14,889 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-11-22 21:58:14,889 INFO L444 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,889 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-11-22 21:58:14,889 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L444 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (or (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0 .cse1 .cse2))) [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L444 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-11-22 21:58:14,890 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-11-22 21:58:14,891 INFO L444 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,891 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-11-22 21:58:14,891 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-22 21:58:14,891 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-11-22 21:58:14,891 INFO L444 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,891 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,891 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-22 21:58:14,891 INFO L444 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L444 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (not (= 0 DiskPerfRegisterDevice_~output~0))) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse4 (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (and .cse0 (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse4) (and (and .cse0 (<= 1 ~s~0) (<= ~s~0 1) .cse1 .cse2 .cse3) .cse4))) [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-22 21:58:14,892 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L444 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) .cse0 (<= ~s~0 1) .cse1 .cse2 .cse3) (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2 .cse3))) [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L444 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-11-22 21:58:14,893 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L444 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (not (= 0 DiskPerfRegisterDevice_~output~0)) (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-11-22 21:58:14,894 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-11-22 21:58:14,895 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse1 (not (= 0 DiskPerfRegisterDevice_~output~0))) (.cse2 (not (= ~pended~0 1))) (.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and .cse0 .cse1 (= ~s~0 ~MPR3~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 1 ~s~0) (<= ~s~0 1) .cse2 .cse3 .cse4))) [2018-11-22 21:58:14,895 INFO L444 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) [2018-11-22 21:58:14,895 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-22 21:58:14,895 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-11-22 21:58:14,895 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-11-22 21:58:14,895 INFO L444 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-22 21:58:14,895 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-11-22 21:58:14,895 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-11-22 21:58:14,896 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse7 (= 1 |old(~pended~0)|)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (= ~myStatus~0 259)) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (< ~IPC~0 (+ ~DC~0 5))) (.cse17 (< |old(~s~0)| 1))) (and (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse3 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (and .cse0 .cse1 (= ~s~0 ~MPR3~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (<= 1 ~s~0) .cse1 .cse2 (<= ~s~0 1) .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (or (= |old(~customIrp~0)| ~customIrp~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |old(~customIrp~0)| 0))))) [2018-11-22 21:58:14,896 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-22 21:58:14,896 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-11-22 21:58:14,896 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-11-22 21:58:14,896 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (= ~myStatus~0 259)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~customIrp~0)| ~customIrp~0) .cse9 .cse10 (not (= |old(~customIrp~0)| 0))))) [2018-11-22 21:58:14,896 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (= ~myStatus~0 259)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |old(~customIrp~0)| ~customIrp~0) .cse8 .cse9 .cse10 (not (= |old(~customIrp~0)| 0))) (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-22 21:58:14,896 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-11-22 21:58:14,897 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-11-22 21:58:14,897 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-22 21:58:14,897 INFO L444 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,897 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-11-22 21:58:14,897 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-22 21:58:14,897 INFO L444 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= ~s~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 .cse1 .cse2 (not (= 259 DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and .cse0 .cse1 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,897 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,898 INFO L444 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= ~s~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 .cse1 .cse2 (not (= 259 DiskPerfStartDevice_~status~1)) .cse3 .cse4 .cse5 .cse6 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and .cse0 .cse1 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) [2018-11-22 21:58:14,898 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,898 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-11-22 21:58:14,898 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-11-22 21:58:14,898 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-11-22 21:58:14,898 INFO L444 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,898 INFO L444 ceAbstractionStarter]: At program point L403-2(lines 403 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,898 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L444 ceAbstractionStarter]: At program point L428(line 428) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L444 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 353 434) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-11-22 21:58:14,899 INFO L444 ceAbstractionStarter]: At program point L396(line 396) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,899 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L444 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (= ~pended~0 1)))) (or (and .cse0 (= 0 DiskPerfDeviceControl_~status~4) .cse1) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and .cse0 (<= (+ DiskPerfDeviceControl_~status~4 1073741789) 0) .cse1))) [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L444 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 288 298) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L444 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-22 21:58:14,900 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-22 21:58:14,901 INFO L444 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-22 21:58:14,901 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-11-22 21:58:14,901 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-11-22 21:58:14,901 INFO L444 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 (not (= 259 DiskPerfRemoveDevice_~status~2)) .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2) (= |old(~myStatus~0)| ~myStatus~0) .cse0 .cse1 .cse2 .cse3 .cse4) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1))) [2018-11-22 21:58:14,901 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-11-22 21:58:14,901 INFO L444 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-22 21:58:14,901 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-11-22 21:58:14,902 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-11-22 21:58:14,902 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-11-22 21:58:14,902 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-11-22 21:58:14,902 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-11-22 21:58:14,902 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-11-22 21:58:14,902 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-11-22 21:58:14,902 INFO L444 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse7 0) (<= 0 .cse7) (<= 1 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse8 1) 0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))))) [2018-11-22 21:58:14,903 INFO L444 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-11-22 21:58:14,903 INFO L444 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))))) [2018-11-22 21:58:14,903 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-11-22 21:58:14,903 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (not (= 0 ~routine~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (= ~myStatus~0 259) (or (or .cse0 .cse1 .cse2 .cse3 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1)))) (or .cse0 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse6 .cse4 .cse5))) [2018-11-22 21:58:14,905 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0)) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-11-22 21:58:14,905 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-11-22 21:58:14,905 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-11-22 21:58:14,905 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-11-22 21:58:14,905 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-11-22 21:58:14,905 INFO L444 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (let ((.cse7 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse8 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse7 0) (<= 0 .cse7) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse8) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse8 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (or (or .cse1 .cse2 .cse9 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))) (or .cse1 .cse9 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-11-22 21:58:14,906 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-11-22 21:58:14,906 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-11-22 21:58:14,906 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-11-22 21:58:14,906 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-11-22 21:58:14,906 INFO L444 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-11-22 21:58:14,910 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-11-22 21:58:14,910 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L444 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or (= ~myStatus~0 259) (or (or .cse0 .cse6 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))))) [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-11-22 21:58:14,911 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-11-22 21:58:14,912 INFO L444 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~myStatus~0 259) (or (or .cse1 .cse2 .cse7 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))) [2018-11-22 21:58:14,912 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-11-22 21:58:14,912 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-11-22 21:58:14,919 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-11-22 21:58:14,920 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L444 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= ~DC~0 ~s~0) (not (= 259 DiskPerfDispatchPnp_~status~0)) (= ~routine~0 0) (<= 1 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-11-22 21:58:14,921 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-22 21:58:14,922 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-11-22 21:58:14,922 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-22 21:58:14,922 INFO L444 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,931 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,931 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-11-22 21:58:14,931 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,931 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-22 21:58:14,931 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-22 21:58:14,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (not (= ~pended~0 1))) [2018-11-22 21:58:14,932 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:58:14,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:58:14,932 INFO L444 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:14,941 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-22 21:58:14,942 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-11-22 21:58:14,942 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-11-22 21:58:14,942 INFO L444 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 435 452) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-22 21:58:15,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:58:15 BoogieIcfgContainer [2018-11-22 21:58:15,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:58:15,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:58:15,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:58:15,012 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:58:15,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:53" (3/4) ... [2018-11-22 21:58:15,017 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-22 21:58:15,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-22 21:58:15,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-22 21:58:15,028 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:58:15,029 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-22 21:58:15,044 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-11-22 21:58:15,045 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-22 21:58:15,046 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-22 21:58:15,048 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:58:15,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 <= NP && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == status)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,084 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) [2018-11-22 21:58:15,084 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) [2018-11-22 21:58:15,084 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-22 21:58:15,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((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(myStatus) == 259) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,085 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-22 21:58:15,086 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,086 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,087 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((myStatus == 259 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((1 <= s && s <= 1) && !(pended == 1)) [2018-11-22 21:58:15,087 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) [2018-11-22 21:58:15,087 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-22 21:58:15,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-22 21:58:15,088 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,089 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,091 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || \old(s) < 1) || !(\old(customIrp) == 0) [2018-11-22 21:58:15,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,093 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-22 21:58:15,215 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_737099a2-250d-4e01-9173-0d99617bfe89/bin-2019/uautomizer/witness.graphml [2018-11-22 21:58:15,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:58:15,216 INFO L168 Benchmark]: Toolchain (without parser) took 22717.19 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 634.9 MB). Free memory was 956.6 MB in the beginning and 1.5 GB in the end (delta: -580.1 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,216 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:58:15,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.95 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,217 INFO L168 Benchmark]: Boogie Preprocessor took 57.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:58:15,217 INFO L168 Benchmark]: RCFGBuilder took 858.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,217 INFO L168 Benchmark]: TraceAbstraction took 21134.98 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -515.2 MB). Peak memory consumption was 693.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,218 INFO L168 Benchmark]: Witness Printer took 202.76 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:58:15,219 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.95 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 858.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21134.98 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 489.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -515.2 MB). Peak memory consumption was 693.6 MB. Max. memory is 11.5 GB. * Witness Printer took 202.76 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 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: ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((1 <= s && s <= 1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 845]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= NP && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(259 == status)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 716]: Loop Invariant Derived loop invariant: ((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\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: ((((((((((((((((1 == \old(pended) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == \old(pended) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || \old(s) < 1) || !(\old(customIrp) == 0) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(compRegistered) == 0)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((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(myStatus) == 259) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((myStatus == 259 || ((((((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: (((((myStatus == 259 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((1 <= s && s <= 1) && !(pended == 1)) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 307 locations, 1 error locations. SAFE Result, 21.0s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 12827 SDtfs, 6671 SDslu, 33748 SDs, 0 SdLazy, 8352 SolverSat, 1300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 268 SyntacticMatches, 10 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s 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.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 1145 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4255 PreInvPairs, 4466 NumberOfFragments, 8314 HoareAnnotationTreeSize, 4255 FomulaSimplifications, 30209 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 109 FomulaSimplificationsInter, 26900 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3229 NumberOfCodeBlocks, 3229 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 462416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 44 InterpolantComputations, 43 PerfectInterpolantSequences, 668/674 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...