./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/config/TaipanReach.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_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 564a601a6273fd55bda5923edf4b35a694c899ec ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:42:31,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:42:31,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:42:31,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:42:31,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:42:31,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:42:31,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:42:31,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:42:31,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:42:31,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:42:31,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:42:31,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:42:31,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:42:31,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:42:31,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:42:31,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:42:31,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:42:31,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:42:31,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:42:31,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:42:31,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:42:31,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:42:31,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:42:31,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:42:31,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:42:31,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:42:31,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:42:31,029 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:42:31,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:42:31,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:42:31,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:42:31,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:42:31,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:42:31,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:42:31,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:42:31,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:42:31,032 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:42:31,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:42:31,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:42:31,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:42:31,040 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:42:31,040 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:42:31,040 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:42:31,040 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:42:31,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:42:31,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:42:31,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:42:31,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:42:31,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:42:31,043 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-12-09 00:42:31,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:42:31,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:42:31,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:42:31,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:42:31,074 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:42:31,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 00:42:31,116 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/data/d09334a0c/890c29ddaaab496381f7ac411604eca4/FLAG78e0f57b2 [2018-12-09 00:42:31,549 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:42:31,549 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 00:42:31,556 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/data/d09334a0c/890c29ddaaab496381f7ac411604eca4/FLAG78e0f57b2 [2018-12-09 00:42:31,564 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/data/d09334a0c/890c29ddaaab496381f7ac411604eca4 [2018-12-09 00:42:31,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:42:31,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:42:31,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:31,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:42:31,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:42:31,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1c9840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31, skipping insertion in model container [2018-12-09 00:42:31,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:42:31,598 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:42:31,742 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:31,745 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:42:31,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:42:31,844 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:42:31,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31 WrapperNode [2018-12-09 00:42:31,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:42:31,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:42:31,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:42:31,845 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:42:31,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:42:31,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:42:31,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:42:31,862 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:42:31,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... [2018-12-09 00:42:31,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:42:31,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:42:31,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:42:31,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:42:31,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:42:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-09 00:42:31,935 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-09 00:42:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:42:31,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:42:31,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-12-09 00:42:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-12-09 00:42:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-09 00:42:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-09 00:42:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-09 00:42:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-09 00:42:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-12-09 00:42:31,936 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-12-09 00:42:31,936 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-09 00:42:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-09 00:42:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-09 00:42:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-09 00:42:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-09 00:42:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-09 00:42:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-09 00:42:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-09 00:42:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-09 00:42:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-09 00:42:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-12-09 00:42:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-12-09 00:42:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-12-09 00:42:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-12-09 00:42:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-12-09 00:42:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-12-09 00:42:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-12-09 00:42:31,938 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-12-09 00:42:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-12-09 00:42:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-12-09 00:42:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-12-09 00:42:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-12-09 00:42:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-12-09 00:42:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-12-09 00:42:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-09 00:42:31,939 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-09 00:42:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-12-09 00:42:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-12-09 00:42:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-09 00:42:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-09 00:42:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-12-09 00:42:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-12-09 00:42:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-12-09 00:42:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-12-09 00:42:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-12-09 00:42:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-12-09 00:42:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:42:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:42:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:42:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:42:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-12-09 00:42:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-12-09 00:42:32,068 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,068 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,151 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,152 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,182 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,182 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,194 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,194 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,311 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,311 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,344 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 00:42:32,344 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 00:42:32,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:42:32,365 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:42:32,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:32 BoogieIcfgContainer [2018-12-09 00:42:32,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:42:32,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:42:32,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:42:32,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:42:32,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:42:31" (1/3) ... [2018-12-09 00:42:32,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:32, skipping insertion in model container [2018-12-09 00:42:32,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:42:31" (2/3) ... [2018-12-09 00:42:32,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:42:32, skipping insertion in model container [2018-12-09 00:42:32,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:32" (3/3) ... [2018-12-09 00:42:32,370 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 00:42:32,376 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:42:32,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:42:32,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:42:32,410 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:42:32,411 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:42:32,411 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:42:32,411 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:42:32,411 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:42:32,411 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:42:32,411 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:42:32,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:42:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-12-09 00:42:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:42:32,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:32,430 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-12-09 00:42:32,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:32,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-12-09 00:42:32,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:32,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:32,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:32,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:32,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:32,569 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-12-09 00:42:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:32,667 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-12-09 00:42:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:32,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 00:42:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:32,675 INFO L225 Difference]: With dead ends: 537 [2018-12-09 00:42:32,675 INFO L226 Difference]: Without dead ends: 287 [2018-12-09 00:42:32,678 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-12-09 00:42:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-09 00:42:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-12-09 00:42:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-09 00:42:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-12-09 00:42:32,716 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-12-09 00:42:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:32,717 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-12-09 00:42:32,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-12-09 00:42:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:42:32,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:32,718 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-12-09 00:42:32,718 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:32,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-12-09 00:42:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:32,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:32,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:32,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:32,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:32,797 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-12-09 00:42:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:32,904 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-12-09 00:42:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:32,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:42:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:32,908 INFO L225 Difference]: With dead ends: 637 [2018-12-09 00:42:32,908 INFO L226 Difference]: Without dead ends: 454 [2018-12-09 00:42:32,909 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-12-09 00:42:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-09 00:42:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-12-09 00:42:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-09 00:42:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-12-09 00:42:32,933 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-12-09 00:42:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-12-09 00:42:32,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-12-09 00:42:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:42:32,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:32,935 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-12-09 00:42:32,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:32,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-12-09 00:42:32,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:32,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:32,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:32,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:32,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:32,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:32,977 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-12-09 00:42:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,008 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-12-09 00:42:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:33,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:42:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,011 INFO L225 Difference]: With dead ends: 963 [2018-12-09 00:42:33,011 INFO L226 Difference]: Without dead ends: 646 [2018-12-09 00:42:33,012 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-12-09 00:42:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-09 00:42:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-12-09 00:42:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-12-09 00:42:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-12-09 00:42:33,036 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-12-09 00:42:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,037 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-12-09 00:42:33,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-12-09 00:42:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:42:33,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,038 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-12-09 00:42:33,038 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-12-09 00:42:33,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:33,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:33,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:33,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:33,079 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-12-09 00:42:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,153 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-12-09 00:42:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:33,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 00:42:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,157 INFO L225 Difference]: With dead ends: 621 [2018-12-09 00:42:33,157 INFO L226 Difference]: Without dead ends: 617 [2018-12-09 00:42:33,157 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-12-09 00:42:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-09 00:42:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-12-09 00:42:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-09 00:42:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-12-09 00:42:33,187 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-12-09 00:42:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,187 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-12-09 00:42:33,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-12-09 00:42:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:42:33,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,189 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-12-09 00:42:33,189 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-12-09 00:42:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:33,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:33,224 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-12-09 00:42:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,288 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-12-09 00:42:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:33,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 00:42:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,291 INFO L225 Difference]: With dead ends: 1072 [2018-12-09 00:42:33,292 INFO L226 Difference]: Without dead ends: 1053 [2018-12-09 00:42:33,292 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-12-09 00:42:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-12-09 00:42:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-12-09 00:42:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-12-09 00:42:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-12-09 00:42:33,321 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-12-09 00:42:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,322 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-12-09 00:42:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-12-09 00:42:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:42:33,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,323 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-12-09 00:42:33,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-12-09 00:42:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:33,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:33,346 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-12-09 00:42:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,412 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-12-09 00:42:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:33,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 00:42:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,417 INFO L225 Difference]: With dead ends: 1050 [2018-12-09 00:42:33,417 INFO L226 Difference]: Without dead ends: 1045 [2018-12-09 00:42:33,418 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-12-09 00:42:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-12-09 00:42:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-12-09 00:42:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-12-09 00:42:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-12-09 00:42:33,444 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-12-09 00:42:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,444 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-12-09 00:42:33,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-12-09 00:42:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:42:33,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,446 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-12-09 00:42:33,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-12-09 00:42:33,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:33,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:33,473 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-12-09 00:42:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,517 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-12-09 00:42:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:33,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-09 00:42:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,523 INFO L225 Difference]: With dead ends: 1058 [2018-12-09 00:42:33,523 INFO L226 Difference]: Without dead ends: 1036 [2018-12-09 00:42:33,524 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-12-09 00:42:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-12-09 00:42:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-12-09 00:42:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-09 00:42:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-12-09 00:42:33,568 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-12-09 00:42:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,568 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-12-09 00:42:33,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-12-09 00:42:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 00:42:33,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,569 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-12-09 00:42:33,570 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-12-09 00:42:33,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:33,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:33,611 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-12-09 00:42:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,637 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-12-09 00:42:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:33,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 00:42:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,640 INFO L225 Difference]: With dead ends: 1448 [2018-12-09 00:42:33,640 INFO L226 Difference]: Without dead ends: 578 [2018-12-09 00:42:33,644 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-12-09 00:42:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-09 00:42:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-12-09 00:42:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-09 00:42:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-12-09 00:42:33,671 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-12-09 00:42:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,671 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-12-09 00:42:33,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-12-09 00:42:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:42:33,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,672 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-12-09 00:42:33,673 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-12-09 00:42:33,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:33,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:33,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:33,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:33,714 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-12-09 00:42:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:33,938 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-12-09 00:42:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:33,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 00:42:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:33,941 INFO L225 Difference]: With dead ends: 586 [2018-12-09 00:42:33,941 INFO L226 Difference]: Without dead ends: 580 [2018-12-09 00:42:33,942 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-12-09 00:42:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-09 00:42:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-09 00:42:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-09 00:42:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-12-09 00:42:33,967 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-12-09 00:42:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:33,967 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-12-09 00:42:33,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-12-09 00:42:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 00:42:33,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:33,968 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-12-09 00:42:33,969 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:33,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-12-09 00:42:33,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:33,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:34,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:34,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:34,007 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-12-09 00:42:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,237 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-12-09 00:42:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:34,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 00:42:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,239 INFO L225 Difference]: With dead ends: 586 [2018-12-09 00:42:34,239 INFO L226 Difference]: Without dead ends: 580 [2018-12-09 00:42:34,239 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-12-09 00:42:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-12-09 00:42:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-12-09 00:42:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-12-09 00:42:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-12-09 00:42:34,255 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-12-09 00:42:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:34,255 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-12-09 00:42:34,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-12-09 00:42:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 00:42:34,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:34,256 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-12-09 00:42:34,256 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:34,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-12-09 00:42:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,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-12-09 00:42:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:34,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:34,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:34,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:34,296 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-12-09 00:42:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,346 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-12-09 00:42:34,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:34,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-09 00:42:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,348 INFO L225 Difference]: With dead ends: 601 [2018-12-09 00:42:34,348 INFO L226 Difference]: Without dead ends: 576 [2018-12-09 00:42:34,349 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-12-09 00:42:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-09 00:42:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-12-09 00:42:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-12-09 00:42:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-12-09 00:42:34,366 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-12-09 00:42:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:34,366 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-12-09 00:42:34,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-12-09 00:42:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 00:42:34,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:34,367 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-12-09 00:42:34,367 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:34,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-12-09 00:42:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:34,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:34,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:34,395 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-12-09 00:42:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,495 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-12-09 00:42:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 00:42:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,499 INFO L225 Difference]: With dead ends: 810 [2018-12-09 00:42:34,499 INFO L226 Difference]: Without dead ends: 802 [2018-12-09 00:42:34,500 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-12-09 00:42:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-12-09 00:42:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-12-09 00:42:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-12-09 00:42:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-12-09 00:42:34,534 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-12-09 00:42:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-12-09 00:42:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-12-09 00:42:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:42:34,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:34,535 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-12-09 00:42:34,536 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:34,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-12-09 00:42:34,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:34,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:34,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:42:34,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:42:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:42:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:34,582 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-12-09 00:42:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,697 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-12-09 00:42:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:42:34,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 00:42:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,699 INFO L225 Difference]: With dead ends: 719 [2018-12-09 00:42:34,699 INFO L226 Difference]: Without dead ends: 452 [2018-12-09 00:42:34,700 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-12-09 00:42:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-12-09 00:42:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-12-09 00:42:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-09 00:42:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-12-09 00:42:34,713 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-12-09 00:42:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:34,713 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-12-09 00:42:34,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:42:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-12-09 00:42:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:42:34,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:34,714 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-12-09 00:42:34,714 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:34,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-12-09 00:42:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:34,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:34,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:34,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:34,758 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-12-09 00:42:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,858 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-12-09 00:42:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:34,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-09 00:42:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,860 INFO L225 Difference]: With dead ends: 447 [2018-12-09 00:42:34,860 INFO L226 Difference]: Without dead ends: 443 [2018-12-09 00:42:34,860 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-12-09 00:42:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-09 00:42:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-12-09 00:42:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-09 00:42:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-12-09 00:42:34,882 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-12-09 00:42:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:34,882 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-12-09 00:42:34,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-12-09 00:42:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 00:42:34,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:34,883 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-12-09 00:42:34,884 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:34,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-12-09 00:42:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:34,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:34,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:34,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:34,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:34,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:34,932 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-12-09 00:42:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:34,994 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-12-09 00:42:34,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:34,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-09 00:42:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:34,996 INFO L225 Difference]: With dead ends: 760 [2018-12-09 00:42:34,996 INFO L226 Difference]: Without dead ends: 462 [2018-12-09 00:42:34,997 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-12-09 00:42:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-09 00:42:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-12-09 00:42:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-09 00:42:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-12-09 00:42:35,011 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-12-09 00:42:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,012 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-12-09 00:42:35,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-12-09 00:42:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:42:35,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,013 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-12-09 00:42:35,013 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-12-09 00:42:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:35,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:35,062 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-12-09 00:42:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:35,377 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-12-09 00:42:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:35,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 00:42:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:35,379 INFO L225 Difference]: With dead ends: 580 [2018-12-09 00:42:35,379 INFO L226 Difference]: Without dead ends: 561 [2018-12-09 00:42:35,380 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-12-09 00:42:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-09 00:42:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-12-09 00:42:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-12-09 00:42:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-12-09 00:42:35,395 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-12-09 00:42:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,395 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-12-09 00:42:35,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-12-09 00:42:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:42:35,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,396 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-12-09 00:42:35,396 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-12-09 00:42:35,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:35,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:35,446 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-12-09 00:42:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:35,541 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-12-09 00:42:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:35,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-09 00:42:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:35,543 INFO L225 Difference]: With dead ends: 448 [2018-12-09 00:42:35,543 INFO L226 Difference]: Without dead ends: 417 [2018-12-09 00:42:35,543 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-12-09 00:42:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-09 00:42:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-09 00:42:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 00:42:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-12-09 00:42:35,556 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-12-09 00:42:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-12-09 00:42:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-12-09 00:42:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:42:35,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,557 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-12-09 00:42:35,558 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-12-09 00:42:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:35,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:35,588 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-12-09 00:42:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:35,619 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-12-09 00:42:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:35,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-09 00:42:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:35,620 INFO L225 Difference]: With dead ends: 432 [2018-12-09 00:42:35,620 INFO L226 Difference]: Without dead ends: 399 [2018-12-09 00:42:35,621 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-12-09 00:42:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-09 00:42:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-12-09 00:42:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 00:42:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-12-09 00:42:35,632 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-12-09 00:42:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,632 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-12-09 00:42:35,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-12-09 00:42:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:42:35,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,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, 1, 1, 1, 1, 1] [2018-12-09 00:42:35,633 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-12-09 00:42:35,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:35,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:35,677 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-12-09 00:42:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:35,751 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-12-09 00:42:35,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:35,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-12-09 00:42:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:35,753 INFO L225 Difference]: With dead ends: 429 [2018-12-09 00:42:35,753 INFO L226 Difference]: Without dead ends: 408 [2018-12-09 00:42:35,753 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-12-09 00:42:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-12-09 00:42:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-12-09 00:42:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-09 00:42:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-12-09 00:42:35,765 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-12-09 00:42:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,766 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-12-09 00:42:35,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-12-09 00:42:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:42:35,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,766 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-12-09 00:42:35,766 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-12-09 00:42:35,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:42:35,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:42:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:42:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:42:35,785 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-12-09 00:42:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:35,814 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-12-09 00:42:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:42:35,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 00:42:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:35,816 INFO L225 Difference]: With dead ends: 436 [2018-12-09 00:42:35,816 INFO L226 Difference]: Without dead ends: 410 [2018-12-09 00:42:35,816 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-12-09 00:42:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-09 00:42:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-12-09 00:42:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-09 00:42:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-12-09 00:42:35,828 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-12-09 00:42:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-12-09 00:42:35,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:42:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-12-09 00:42:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:42:35,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:35,829 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-12-09 00:42:35,829 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:35,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-12-09 00:42:35,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:35,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:35,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:42:35,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:35,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:42:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:42:35,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:42:35,872 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-12-09 00:42:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:36,228 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-12-09 00:42:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:42:36,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-09 00:42:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:36,231 INFO L225 Difference]: With dead ends: 565 [2018-12-09 00:42:36,231 INFO L226 Difference]: Without dead ends: 511 [2018-12-09 00:42:36,231 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-12-09 00:42:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-09 00:42:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-12-09 00:42:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-12-09 00:42:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-12-09 00:42:36,248 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-12-09 00:42:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:36,249 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-12-09 00:42:36,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:42:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-12-09 00:42:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:42:36,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:36,249 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-12-09 00:42:36,250 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:36,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:36,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-12-09 00:42:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:36,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:36,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:36,270 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-12-09 00:42:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:36,364 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-12-09 00:42:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-09 00:42:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:36,366 INFO L225 Difference]: With dead ends: 673 [2018-12-09 00:42:36,366 INFO L226 Difference]: Without dead ends: 659 [2018-12-09 00:42:36,367 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-12-09 00:42:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-09 00:42:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-12-09 00:42:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-12-09 00:42:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-12-09 00:42:36,389 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-12-09 00:42:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:36,389 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-12-09 00:42:36,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-12-09 00:42:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:42:36,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:36,390 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-12-09 00:42:36,390 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:36,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-12-09 00:42:36,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:36,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:36,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:36,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:36,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:42:36,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:36,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:42:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:42:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:36,431 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-12-09 00:42:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:36,489 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-12-09 00:42:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:42:36,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-09 00:42:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:36,491 INFO L225 Difference]: With dead ends: 598 [2018-12-09 00:42:36,492 INFO L226 Difference]: Without dead ends: 574 [2018-12-09 00:42:36,492 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-12-09 00:42:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-09 00:42:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-09 00:42:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-09 00:42:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-12-09 00:42:36,526 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-12-09 00:42:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:36,526 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-12-09 00:42:36,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:42:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-12-09 00:42:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:42:36,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:36,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:42:36,527 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:36,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-12-09 00:42:36,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:36,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:36,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:36,560 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-12-09 00:42:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:36,847 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-12-09 00:42:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:36,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 00:42:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:36,849 INFO L225 Difference]: With dead ends: 660 [2018-12-09 00:42:36,850 INFO L226 Difference]: Without dead ends: 624 [2018-12-09 00:42:36,850 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-12-09 00:42:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-12-09 00:42:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-12-09 00:42:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-12-09 00:42:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-12-09 00:42:36,872 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-12-09 00:42:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:36,872 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-12-09 00:42:36,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-12-09 00:42:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 00:42:36,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:36,872 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-12-09 00:42:36,872 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:36,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-12-09 00:42:36,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:36,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:36,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:36,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:36,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:36,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:36,903 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-12-09 00:42:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:36,952 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-12-09 00:42:36,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:36,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-09 00:42:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:36,955 INFO L225 Difference]: With dead ends: 955 [2018-12-09 00:42:36,955 INFO L226 Difference]: Without dead ends: 527 [2018-12-09 00:42:36,957 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-12-09 00:42:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-12-09 00:42:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-12-09 00:42:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-12-09 00:42:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-12-09 00:42:36,993 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-12-09 00:42:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:36,993 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-12-09 00:42:36,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-12-09 00:42:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:42:36,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:36,994 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-12-09 00:42:36,994 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-12-09 00:42:36,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:36,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:42:37,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:42:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:42:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:42:37,069 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-12-09 00:42:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:37,175 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-12-09 00:42:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:42:37,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-09 00:42:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:37,178 INFO L225 Difference]: With dead ends: 529 [2018-12-09 00:42:37,178 INFO L226 Difference]: Without dead ends: 466 [2018-12-09 00:42:37,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:42:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-09 00:42:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-12-09 00:42:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-12-09 00:42:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-12-09 00:42:37,208 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-12-09 00:42:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:37,208 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-12-09 00:42:37,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:42:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-12-09 00:42:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 00:42:37,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:37,209 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-12-09 00:42:37,209 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:37,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-12-09 00:42:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:37,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:37,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:37,260 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-12-09 00:42:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:37,313 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-12-09 00:42:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:37,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 00:42:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:37,316 INFO L225 Difference]: With dead ends: 918 [2018-12-09 00:42:37,317 INFO L226 Difference]: Without dead ends: 491 [2018-12-09 00:42:37,318 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-12-09 00:42:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-12-09 00:42:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-12-09 00:42:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-09 00:42:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-12-09 00:42:37,338 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-12-09 00:42:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:37,339 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-12-09 00:42:37,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-12-09 00:42:37,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 00:42:37,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:37,339 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-12-09 00:42:37,339 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:37,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:37,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-12-09 00:42:37,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:42:37,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:42:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:42:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:42:37,363 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-12-09 00:42:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:37,442 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-12-09 00:42:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:42:37,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-09 00:42:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:37,446 INFO L225 Difference]: With dead ends: 730 [2018-12-09 00:42:37,446 INFO L226 Difference]: Without dead ends: 727 [2018-12-09 00:42:37,446 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-12-09 00:42:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-09 00:42:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-12-09 00:42:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-09 00:42:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-12-09 00:42:37,474 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-12-09 00:42:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:37,474 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-12-09 00:42:37,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:42:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-12-09 00:42:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 00:42:37,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:37,475 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-12-09 00:42:37,475 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:37,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-12-09 00:42:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:37,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:37,567 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-12-09 00:42:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:37,618 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-12-09 00:42:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:37,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 00:42:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:37,619 INFO L225 Difference]: With dead ends: 755 [2018-12-09 00:42:37,619 INFO L226 Difference]: Without dead ends: 312 [2018-12-09 00:42:37,621 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-12-09 00:42:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-09 00:42:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-12-09 00:42:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-09 00:42:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-12-09 00:42:37,637 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-12-09 00:42:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:37,637 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-12-09 00:42:37,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-12-09 00:42:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 00:42:37,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:37,638 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-12-09 00:42:37,638 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:37,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:37,638 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-12-09 00:42:37,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:37,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:37,684 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-12-09 00:42:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:37,841 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-12-09 00:42:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:42:37,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 00:42:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:37,842 INFO L225 Difference]: With dead ends: 579 [2018-12-09 00:42:37,842 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 00:42:37,843 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-12-09 00:42:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 00:42:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-09 00:42:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-09 00:42:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-12-09 00:42:37,859 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-12-09 00:42:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-12-09 00:42:37,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-12-09 00:42:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:42:37,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:37,860 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-12-09 00:42:37,860 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:37,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash 438765614, now seen corresponding path program 1 times [2018-12-09 00:42:37,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:37,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:37,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:37,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:37,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:37,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:37,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:37,925 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-12-09 00:42:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:38,252 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-12-09 00:42:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:38,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-09 00:42:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:38,254 INFO L225 Difference]: With dead ends: 669 [2018-12-09 00:42:38,254 INFO L226 Difference]: Without dead ends: 405 [2018-12-09 00:42:38,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:42:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-09 00:42:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-12-09 00:42:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-09 00:42:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-12-09 00:42:38,271 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 70 [2018-12-09 00:42:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:38,271 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-12-09 00:42:38,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-12-09 00:42:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:42:38,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:38,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 00:42:38,272 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:38,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-12-09 00:42:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:38,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:38,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:38,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:38,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:38,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:38,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:38,311 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-12-09 00:42:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:38,359 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-12-09 00:42:38,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:38,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-09 00:42:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:38,361 INFO L225 Difference]: With dead ends: 691 [2018-12-09 00:42:38,361 INFO L226 Difference]: Without dead ends: 369 [2018-12-09 00:42:38,363 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-12-09 00:42:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-09 00:42:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-12-09 00:42:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-09 00:42:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-12-09 00:42:38,389 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-12-09 00:42:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:38,390 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-12-09 00:42:38,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-12-09 00:42:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 00:42:38,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:38,391 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-12-09 00:42:38,391 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-12-09 00:42:38,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:38,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:38,442 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-12-09 00:42:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:38,679 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-12-09 00:42:38,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:42:38,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 00:42:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:38,681 INFO L225 Difference]: With dead ends: 642 [2018-12-09 00:42:38,681 INFO L226 Difference]: Without dead ends: 337 [2018-12-09 00:42:38,682 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-12-09 00:42:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-09 00:42:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-12-09 00:42:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-09 00:42:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-12-09 00:42:38,705 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-12-09 00:42:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:38,706 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-12-09 00:42:38,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-12-09 00:42:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 00:42:38,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:38,707 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-12-09 00:42:38,707 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:38,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-12-09 00:42:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:38,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-12-09 00:42:38,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:38,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 00:42:38,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:38,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 00:42:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 00:42:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:42:38,810 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-12-09 00:42:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:38,922 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-12-09 00:42:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:42:38,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-12-09 00:42:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:38,924 INFO L225 Difference]: With dead ends: 626 [2018-12-09 00:42:38,924 INFO L226 Difference]: Without dead ends: 333 [2018-12-09 00:42:38,925 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-12-09 00:42:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-09 00:42:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-12-09 00:42:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-09 00:42:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-12-09 00:42:38,940 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-12-09 00:42:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:38,941 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-12-09 00:42:38,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 00:42:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-12-09 00:42:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 00:42:38,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:38,942 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-12-09 00:42:38,942 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:38,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:38,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-12-09 00:42:38,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:38,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 00:42:39,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:42:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:42:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:39,037 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-12-09 00:42:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:39,795 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-12-09 00:42:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:42:39,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-12-09 00:42:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:39,796 INFO L225 Difference]: With dead ends: 364 [2018-12-09 00:42:39,796 INFO L226 Difference]: Without dead ends: 322 [2018-12-09 00:42:39,796 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-12-09 00:42:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-09 00:42:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-12-09 00:42:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-09 00:42:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-12-09 00:42:39,810 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-12-09 00:42:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:39,810 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-12-09 00:42:39,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:42:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-12-09 00:42:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 00:42:39,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:39,811 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-12-09 00:42:39,811 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:39,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-12-09 00:42:39,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:39,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:39,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:39,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 00:42:39,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:39,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 00:42:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 00:42:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:42:39,926 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-12-09 00:42:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:40,033 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-12-09 00:42:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:42:40,033 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-12-09 00:42:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:40,034 INFO L225 Difference]: With dead ends: 353 [2018-12-09 00:42:40,034 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 00:42:40,035 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-12-09 00:42:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 00:42:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-12-09 00:42:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-09 00:42:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-12-09 00:42:40,051 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-12-09 00:42:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:40,051 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-12-09 00:42:40,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 00:42:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-12-09 00:42:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 00:42:40,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:40,053 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-12-09 00:42:40,053 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:40,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-12-09 00:42:40,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 00:42:40,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:40,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:42:40,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:40,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:42:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:42:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:42:40,104 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-12-09 00:42:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:40,325 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-12-09 00:42:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:40,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-12-09 00:42:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:40,327 INFO L225 Difference]: With dead ends: 709 [2018-12-09 00:42:40,327 INFO L226 Difference]: Without dead ends: 447 [2018-12-09 00:42:40,328 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-12-09 00:42:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-09 00:42:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-12-09 00:42:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-09 00:42:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-12-09 00:42:40,347 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-12-09 00:42:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:40,347 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-12-09 00:42:40,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:42:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-12-09 00:42:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 00:42:40,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:40,349 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-12-09 00:42:40,349 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:40,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:40,349 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-12-09 00:42:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:40,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:42:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 00:42:40,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:42:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:42:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:42:40,444 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-12-09 00:42:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,127 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-12-09 00:42:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:42:41,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-12-09 00:42:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,128 INFO L225 Difference]: With dead ends: 405 [2018-12-09 00:42:41,128 INFO L226 Difference]: Without dead ends: 341 [2018-12-09 00:42:41,129 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-12-09 00:42:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-12-09 00:42:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-12-09 00:42:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-09 00:42:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-12-09 00:42:41,150 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-12-09 00:42:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,150 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-12-09 00:42:41,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:42:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-12-09 00:42:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:42:41,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,152 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-12-09 00:42:41,152 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:41,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-12-09 00:42:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 00:42:41,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:41,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:41,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:41,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:41,208 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-12-09 00:42:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:41,246 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-12-09 00:42:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:41,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-12-09 00:42:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:41,247 INFO L225 Difference]: With dead ends: 468 [2018-12-09 00:42:41,247 INFO L226 Difference]: Without dead ends: 322 [2018-12-09 00:42:41,248 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-12-09 00:42:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-09 00:42:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-12-09 00:42:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-09 00:42:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-12-09 00:42:41,261 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-12-09 00:42:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:41,262 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-12-09 00:42:41,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-12-09 00:42:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-09 00:42:41,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:41,262 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-12-09 00:42:41,263 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:41,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-12-09 00:42:41,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:41,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 00:42:41,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:41,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:42:41,316 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-12-09 00:42:41,317 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [376], [379], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-12-09 00:42:41,342 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:42:41,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:42:41,800 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:42:41,801 INFO L272 AbstractInterpreter]: Visited 100 different actions 318 times. Merged at 21 different actions 52 times. Never widened. Performed 6028 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6028 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-12-09 00:42:41,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:41,806 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:42:42,101 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 84.78% of their original sizes. [2018-12-09 00:42:42,102 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:42:42,940 INFO L418 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-12-09 00:42:42,940 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:42:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:42:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2018-12-09 00:42:42,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:42,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-09 00:42:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-09 00:42:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2909, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 00:42:42,943 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 57 states. [2018-12-09 00:42:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:57,914 INFO L93 Difference]: Finished difference Result 576 states and 743 transitions. [2018-12-09 00:42:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-09 00:42:57,914 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-12-09 00:42:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:57,916 INFO L225 Difference]: With dead ends: 576 [2018-12-09 00:42:57,916 INFO L226 Difference]: Without dead ends: 401 [2018-12-09 00:42:57,919 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1111, Invalid=11099, Unknown=0, NotChecked=0, Total=12210 [2018-12-09 00:42:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-09 00:42:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 281. [2018-12-09 00:42:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-09 00:42:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 325 transitions. [2018-12-09 00:42:57,952 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 325 transitions. Word has length 163 [2018-12-09 00:42:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:57,952 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 325 transitions. [2018-12-09 00:42:57,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-09 00:42:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 325 transitions. [2018-12-09 00:42:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-09 00:42:57,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:57,953 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-12-09 00:42:57,953 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:57,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1794911829, now seen corresponding path program 1 times [2018-12-09 00:42:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:57,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:57,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 00:42:58,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:58,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:42:58,005 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-12-09 00:42:58,005 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [398], [402], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-12-09 00:42:58,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:42:58,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:42:58,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:42:58,245 INFO L272 AbstractInterpreter]: Visited 108 different actions 336 times. Merged at 24 different actions 56 times. Never widened. Performed 6518 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-12-09 00:42:58,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:42:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:42:58,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/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-12-09 00:42:58,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:58,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:42:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:58,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:42:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:42:58,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:42:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 00:42:58,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:42:58,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2018-12-09 00:42:58,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:58,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:42:58,596 INFO L87 Difference]: Start difference. First operand 281 states and 325 transitions. Second operand 6 states. [2018-12-09 00:42:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:58,652 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2018-12-09 00:42:58,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:58,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-12-09 00:42:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:58,653 INFO L225 Difference]: With dead ends: 448 [2018-12-09 00:42:58,653 INFO L226 Difference]: Without dead ends: 296 [2018-12-09 00:42:58,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:42:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-09 00:42:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2018-12-09 00:42:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-09 00:42:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-12-09 00:42:58,678 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 163 [2018-12-09 00:42:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:58,678 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-12-09 00:42:58,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-12-09 00:42:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 00:42:58,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:58,679 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-12-09 00:42:58,679 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:58,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-12-09 00:42:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-09 00:42:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:58,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:58,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:58,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:58,739 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 6 states. [2018-12-09 00:42:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:58,794 INFO L93 Difference]: Finished difference Result 453 states and 534 transitions. [2018-12-09 00:42:58,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:58,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-12-09 00:42:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:58,796 INFO L225 Difference]: With dead ends: 453 [2018-12-09 00:42:58,796 INFO L226 Difference]: Without dead ends: 319 [2018-12-09 00:42:58,797 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-12-09 00:42:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-09 00:42:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 284. [2018-12-09 00:42:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-12-09 00:42:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-12-09 00:42:58,823 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 164 [2018-12-09 00:42:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:58,823 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-12-09 00:42:58,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-12-09 00:42:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-09 00:42:58,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:58,824 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-12-09 00:42:58,824 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:58,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-12-09 00:42:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-12-09 00:42:58,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:58,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:58,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:58,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:58,885 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-12-09 00:42:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:58,934 INFO L93 Difference]: Finished difference Result 344 states and 391 transitions. [2018-12-09 00:42:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:58,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-12-09 00:42:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:58,936 INFO L225 Difference]: With dead ends: 344 [2018-12-09 00:42:58,936 INFO L226 Difference]: Without dead ends: 271 [2018-12-09 00:42:58,936 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-12-09 00:42:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-09 00:42:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-12-09 00:42:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-09 00:42:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2018-12-09 00:42:58,955 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 204 [2018-12-09 00:42:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:58,955 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2018-12-09 00:42:58,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2018-12-09 00:42:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 00:42:58,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:42:58,956 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-12-09 00:42:58,956 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:42:58,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:42:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-12-09 00:42:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:42:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:42:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:42:58,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:42:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:42:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-12-09 00:42:59,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:42:59,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:42:59,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:42:59,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:42:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:42:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:42:59,019 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand 6 states. [2018-12-09 00:42:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:42:59,058 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2018-12-09 00:42:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:42:59,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-12-09 00:42:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:42:59,058 INFO L225 Difference]: With dead ends: 255 [2018-12-09 00:42:59,058 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:42:59,059 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-12-09 00:42:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:42:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:42:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:42:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:42:59,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-12-09 00:42:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:42:59,060 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:42:59,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:42:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:42:59,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:42:59,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:42:59,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:42:59,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:43:00,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:43:00,331 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 84 [2018-12-09 00:43:00,781 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-12-09 00:43:00,935 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 68 [2018-12-09 00:43:01,097 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-12-09 00:43:01,491 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-12-09 00:43:01,675 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2018-12-09 00:43:02,095 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2018-12-09 00:43:02,312 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-12-09 00:43:02,553 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-12-09 00:43:02,795 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2018-12-09 00:43:03,117 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 66 [2018-12-09 00:43:03,364 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2018-12-09 00:43:04,074 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 75 [2018-12-09 00:43:04,272 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 47 [2018-12-09 00:43:05,281 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-12-09 00:43:05,547 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-12-09 00:43:05,778 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-12-09 00:43:06,073 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-09 00:43:06,249 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-12-09 00:43:06,458 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2018-12-09 00:43:06,636 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-12-09 00:43:06,951 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 69 [2018-12-09 00:43:07,172 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2018-12-09 00:43:07,605 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-12-09 00:43:07,893 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-09 00:43:08,265 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-12-09 00:43:08,454 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-09 00:43:08,619 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-12-09 00:43:09,015 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2018-12-09 00:43:09,266 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-12-09 00:43:09,388 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-12-09 00:43:09,663 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-12-09 00:43:10,009 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-12-09 00:43:10,072 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-12-09 00:43:10,072 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-12-09 00:43:10,072 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-12-09 00:43:10,072 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-12-09 00:43:10,072 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-12-09 00:43:10,072 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-12-09 00:43:10,072 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-12-09 00:43:10,072 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-12-09 00:43:10,072 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-12-09 00:43:10,073 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-12-09 00:43:10,073 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-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-12-09 00:43:10,073 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-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-12-09 00:43:10,073 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-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-12-09 00:43:10,073 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-12-09 00:43:10,074 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-12-09 00:43:10,074 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-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-12-09 00:43:10,074 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-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-12-09 00:43:10,074 INFO L444 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |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-12-09 00:43:10,074 INFO L444 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |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-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-12-09 00:43:10,074 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-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-12-09 00:43:10,074 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-12-09 00:43:10,075 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-12-09 00:43:10,075 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-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-12-09 00:43:10,075 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-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-12-09 00:43:10,075 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-12-09 00:43:10,075 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-12-09 00:43:10,075 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (and (<= 1 ~s~0) (<= ~s~0 1)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-12-09 00:43:10,075 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-12-09 00:43:10,075 INFO L444 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-12-09 00:43:10,076 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-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-12-09 00:43:10,076 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-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-12-09 00:43:10,076 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-12-09 00:43:10,076 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-12-09 00:43:10,076 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-12-09 00:43:10,076 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-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-12-09 00:43:10,076 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-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-12-09 00:43:10,076 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-12-09 00:43:10,077 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-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-12-09 00:43:10,077 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-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-12-09 00:43:10,077 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-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-12-09 00:43:10,077 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-12-09 00:43:10,077 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-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-12-09 00:43:10,077 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-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-12-09 00:43:10,077 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-12-09 00:43:10,078 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-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-12-09 00:43:10,078 INFO L444 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-12-09 00:43:10,078 INFO L444 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-12-09 00:43:10,078 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-12-09 00:43:10,078 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-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-12-09 00:43:10,078 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-12-09 00:43:10,078 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-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-12-09 00:43:10,079 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)))) (not (= 0 ~routine~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 ~s~0))) [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-12-09 00:43:10,079 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-12-09 00:43:10,079 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-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-12-09 00:43:10,079 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-12-09 00:43:10,079 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-12-09 00:43:10,080 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 (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0 .cse1 .cse2) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)))) [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L444 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L444 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-12-09 00:43:10,080 INFO L444 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,080 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,080 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L444 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L444 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (and (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (let ((.cse0 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344))) (or (and .cse0 (= ~s~0 1)) (and (= ~s~0 6) .cse0))) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L444 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse2 (let ((.cse7 (= ~NP~0 1)) (.cse8 (= ~MPR1~0 5)) (.cse9 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse10 (= ~routine~0 0)) (.cse11 (= ~MPR3~0 6))) (or (and .cse0 .cse7 .cse8 .cse9 (= ~s~0 6) .cse10 .cse11) (and .cse0 .cse7 .cse8 .cse9 .cse10 (= ~s~0 1) .cse11)))) (.cse3 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (not (= 5 ~MPR1~0)) (and .cse1 .cse2 .cse3 (<= ~s~0 1) .cse4 .cse5 .cse6) (not (= 6 ~MPR3~0)) (and .cse1 (<= 0 DiskPerfRegisterDevice_~status~5) .cse2 .cse3 .cse4 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse5 .cse6) (not (= 1 |old(~s~0)|))))) [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-12-09 00:43:10,081 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L444 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L444 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse2 (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280)) (.cse3 (let ((.cse9 (= ~NP~0 1)) (.cse10 (= ~MPR1~0 5)) (.cse11 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse12 (= ~routine~0 0))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 (= ~s~0 1)) (and .cse0 .cse9 .cse10 (= ~s~0 6) .cse11 .cse12)))) (.cse4 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse5 (not (= DiskPerfRegisterDevice_~output~0 0))) (.cse6 (not (= ~pended~0 1))) (.cse7 (<= 1 ~setEventCalled~0)) (.cse8 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (and .cse1 (and .cse2 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (not (= 5 ~MPR1~0)) (and .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= ~s~0 1) .cse6 .cse7 .cse8)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))))) [2018-12-09 00:43:10,082 INFO L444 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-12-09 00:43:10,082 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-12-09 00:43:10,083 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-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse2 (= 1 |old(~pended~0)|)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (= ~myStatus~0 259)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5)))) (and (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (= ~compRegistered~0 1))) (or (and .cse0 (= ~s~0 1) .cse1) .cse2 .cse3 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 5 ~MPR1~0)) (and .cse0 (and .cse1 (= (mod DiskPerfForwardIrpSynchronous_~status~3 259) 0))) .cse9 (not (= |old(~customIrp~0)| 0)))) (let ((.cse10 (<= 1 ~compRegistered~0)) (.cse11 (= ~routine~0 0)) (.cse12 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse13 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse14 (not (= ~pended~0 1))) (.cse15 (<= 1 ~setEventCalled~0)) (.cse16 (<= ~setEventCalled~0 1))) (or (and .cse10 .cse11 (= ~s~0 ~MPR3~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse10 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (<= 1 ~s~0) .cse11 .cse12 (<= ~s~0 1) .cse13 .cse14 .cse15 .cse16) .cse2 (< ~MPR1~0 (+ ~NP~0 4)) .cse3 (< 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1))))) [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (= ~myStatus~0 259)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or .cse0 (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-12-09 00:43:10,083 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (= ~myStatus~0 259)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-12-09 00:43:10,083 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-12-09 00:43:10,083 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)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-12-09 00:43:10,083 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L444 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,084 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (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))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,084 INFO L444 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,084 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (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))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-12-09 00:43:10,084 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-12-09 00:43:10,084 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-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-12-09 00:43:10,084 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-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-12-09 00:43:10,084 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-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-12-09 00:43:10,084 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-12-09 00:43:10,085 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-12-09 00:43:10,085 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-12-09 00:43:10,085 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-12-09 00:43:10,085 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-12-09 00:43:10,086 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-12-09 00:43:10,086 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-12-09 00:43:10,086 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-12-09 00:43:10,086 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-12-09 00:43:10,086 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-12-09 00:43:10,086 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-12-09 00:43:10,086 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-12-09 00:43:10,087 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-12-09 00:43:10,087 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-12-09 00:43:10,087 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-12-09 00:43:10,087 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-12-09 00:43:10,087 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-12-09 00:43:10,087 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-12-09 00:43:10,087 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-12-09 00:43:10,087 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-12-09 00:43:10,089 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-12-09 00:43:10,089 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-12-09 00:43:10,090 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-12-09 00:43:10,090 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-12-09 00:43:10,090 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-12-09 00:43:10,090 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-12-09 00:43:10,090 INFO L444 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse14 (not (= 0 ~routine~0))) (.cse20 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (= 1 |old(~pended~0)|)) (.cse18 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse19 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse14 .cse20 .cse15 .cse16 (< ~compRegistered~0 1) .cse18 .cse19)) (.cse3 (not (= 5 ~MPR1~0))) (.cse5 (<= (+ .cse21 1) 0)) (.cse6 (<= 1 ~setEventCalled~0)) (.cse7 (= (+ IofCallDriver_~compRetStatus~0 1073741802) 0)) (.cse8 (= ~s~0 1)) (.cse9 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse10 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (not (= ~pended~0 1))) (.cse12 (<= ~setEventCalled~0 1)) (.cse4 (not (= 6 ~MPR3~0))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= ~customIrp~0 0)) .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse4 .cse13) (or .cse14 .cse15 .cse16 .cse17 (not (= ~SKIP1~0 |old(~s~0)|)) .cse18 .cse19) (or .cse14 .cse20 .cse16 .cse17 .cse18 .cse19)))) [2018-12-09 00:43:10,090 INFO L444 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-12-09 00:43:10,090 INFO L444 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-12-09 00:43:10,093 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-12-09 00:43:10,093 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse9 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (= 1 |old(~pended~0)|)) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse12 (not (= ~compRegistered~0 0))) (.cse3 (= ~myStatus~0 259)) (.cse0 (<= 1 ~s~0)) (.cse1 (<= ~s~0 1)) (.cse2 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (or .cse9 .cse15 .cse10 .cse11 (< ~compRegistered~0 1) .cse13 .cse14)) (.cse6 (not (= 5 ~MPR1~0))) (.cse7 (not (= 6 ~MPR3~0))) (.cse8 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~customIrp~0 0)) .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~SKIP1~0 |old(~s~0)|)) .cse13 .cse14) (or .cse9 .cse15 .cse11 .cse12 .cse13 .cse14) (or (= |IofCallDriver_#in~Irp| 0) .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse0 .cse1 .cse2) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-12-09 00:43:10,094 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse7)) (.cse1 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse11 (not (= ~compRegistered~0 0)))) (and (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13)))) [2018-12-09 00:43:10,094 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-12-09 00:43:10,094 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-12-09 00:43:10,094 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-12-09 00:43:10,094 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-12-09 00:43:10,094 INFO L444 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (not (= 0 ~routine~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse10 (or .cse1 .cse2 .cse13 .cse3 (< ~compRegistered~0 1) .cse5 .cse6)) (.cse12 (not (= 6 ~MPR3~0))) (.cse7 (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse14 0) (<= 0 .cse14) (<= (+ .cse15 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) (not (= 1 |old(~s~0)|))) (or .cse1 .cse13 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or (= |IofCallDriver_#in~Irp| 0) .cse10 .cse12 (not (= 1 ~NP~0)) .cse7 .cse8 .cse9 .cse11)))) [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L444 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse11 (not (= ~compRegistered~0 0))) (.cse1 (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse15 0) (<= 0 .cse15) (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse7 (<= ~setEventCalled~0 1)))) (.cse0 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-12-09 00:43:10,099 INFO L444 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-12-09 00:43:10,105 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-12-09 00:43:10,105 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-12-09 00:43:10,105 INFO L444 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-12-09 00:43:10,106 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-12-09 00:43:10,111 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-12-09 00:43:10,111 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-12-09 00:43:10,111 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-12-09 00:43:10,111 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L444 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L444 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,112 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)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,112 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-12-09 00:43:10,112 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (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))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,114 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (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))) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 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)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:43:10,114 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-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:43:10,114 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-12-09 00:43:10,114 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:43:10,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:43:10,114 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-12-09 00:43:10,115 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-12-09 00:43:10,115 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-12-09 00:43:10,115 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-12-09 00:43:10,115 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-12-09 00:43:10,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:43:10 BoogieIcfgContainer [2018-12-09 00:43:10,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:43:10,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:43:10,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:43:10,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:43:10,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:42:32" (3/4) ... [2018-12-09 00:43:10,145 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:43:10,149 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-12-09 00:43:10,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-12-09 00:43:10,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:43:10,151 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-12-09 00:43:10,159 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-12-09 00:43:10,160 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-12-09 00:43:10,160 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 00:43:10,161 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:43:10,180 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-12-09 00:43:10,180 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-12-09 00:43:10,180 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-12-09 00:43:10,181 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 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))) && ((((((((((((((((((((((!(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 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-09 00:43:10,181 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 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))) && ((((((((((((((((((((((!(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 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-09 00:43:10,181 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-12-09 00:43:10,181 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((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)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-09 00:43:10,181 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-12-09 00:43:10,182 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-12-09 00:43:10,182 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) && (((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) [2018-12-09 00:43:10,182 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(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)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-09 00:43:10,182 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-12-09 00:43:10,182 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((myStatus == 259 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) [2018-12-09 00:43:10,182 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-12-09 00:43:10,183 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-12-09 00:43:10,183 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-12-09 00:43:10,183 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((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)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-09 00:43:10,183 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) [2018-12-09 00:43:10,183 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-12-09 00:43:10,184 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == \old(pended) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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-12-09 00:43:10,184 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-12-09 00:43:10,184 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-12-09 00:43:10,184 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-09 00:43:10,184 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)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-12-09 00:43:10,184 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || !(\old(customIrp) == 0) [2018-12-09 00:43:10,185 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-12-09 00:43:10,185 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-12-09 00:43:10,235 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd7398b0-c2fc-46af-a903-1b2d02bbc0ba/bin-2019/utaipan/witness.graphml [2018-12-09 00:43:10,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:43:10,235 INFO L168 Benchmark]: Toolchain (without parser) took 38669.45 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 936.4 MB). Free memory was 948.1 MB in the beginning and 1.3 GB in the end (delta: -330.1 MB). Peak memory consumption was 606.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,236 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:43:10,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:43:10,236 INFO L168 Benchmark]: Boogie Preprocessor took 32.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,236 INFO L168 Benchmark]: RCFGBuilder took 470.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.7 MB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,237 INFO L168 Benchmark]: TraceAbstraction took 37775.64 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 839.4 MB). Free memory was 997.7 MB in the beginning and 1.3 GB in the end (delta: -301.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,237 INFO L168 Benchmark]: Witness Printer took 93.11 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:43:10,238 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 470.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.7 MB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37775.64 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 839.4 MB). Free memory was 997.7 MB in the beginning and 1.3 GB in the end (delta: -301.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 93.11 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 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: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 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))) && ((((((((((((((((((((((!(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 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 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: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 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))) && ((((((((((((((((((((((!(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 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) - 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: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((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)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(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) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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: 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) && (((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 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)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\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) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(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)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\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: (((((((((myStatus == 259 || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((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)) || !(6 == MPR3)) || !(1 == \old(s)))) && (((((((!(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 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) - 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, 37.7s OverallTime, 44 OverallIterations, 4 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12967 SDtfs, 7777 SDslu, 36784 SDs, 0 SdLazy, 12092 SolverSat, 2047 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 900 GetRequests, 532 SyntacticMatches, 13 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 3.9s 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.7s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9438488180591708 AbsIntWeakeningRatio, 2.1481481481481484 AbsIntAvgWeakeningVarsNumRemoved, 10.839506172839506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 1272 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4386 PreInvPairs, 4627 NumberOfFragments, 9601 HoareAnnotationTreeSize, 4386 FomulaSimplifications, 66727 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 109 FomulaSimplificationsInter, 45437 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3392 NumberOfCodeBlocks, 3392 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3509 ConstructedInterpolants, 0 QuantifiedInterpolants, 519278 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 46 InterpolantComputations, 43 PerfectInterpolantSequences, 830/848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...