./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9caca1067e52a4490439beb955df6129aef4eea8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:23:04,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:23:04,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:23:04,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:23:04,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:23:04,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:23:04,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:23:04,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:23:04,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:23:04,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:23:04,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:23:04,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:23:04,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:23:04,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:23:04,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:23:04,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:23:04,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:23:04,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:23:04,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:23:04,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:23:04,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:23:04,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:23:04,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:23:04,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:23:04,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:23:04,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:23:04,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:23:04,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:23:04,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:23:04,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:23:04,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:23:04,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:23:04,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:23:04,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:23:04,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:23:04,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:23:04,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:23:04,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:23:04,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:23:04,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:23:04,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:23:04,211 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:23:04,251 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:23:04,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:23:04,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:23:04,254 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:23:04,254 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:23:04,254 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:23:04,255 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:23:04,255 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:23:04,261 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:23:04,261 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:23:04,262 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:23:04,263 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:23:04,263 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:23:04,263 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:23:04,263 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:23:04,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:23:04,264 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:23:04,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:23:04,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:23:04,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:23:04,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:23:04,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:23:04,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:23:04,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:23:04,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:23:04,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:23:04,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:23:04,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:23:04,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:23:04,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:23:04,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:04,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:23:04,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:23:04,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:23:04,270 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:23:04,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:23:04,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:23:04,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:23:04,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:23:04,271 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI 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(reach_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 -> 9caca1067e52a4490439beb955df6129aef4eea8 [2021-10-11 02:23:04,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:23:04,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:23:04,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:23:04,603 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:23:04,607 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:23:04,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-11 02:23:04,706 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/data/d788b059e/6904ad9647914b68aff153d7b05bd6b1/FLAGeabc1e220 [2021-10-11 02:23:05,202 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:23:05,203 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-10-11 02:23:05,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/data/d788b059e/6904ad9647914b68aff153d7b05bd6b1/FLAGeabc1e220 [2021-10-11 02:23:05,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/data/d788b059e/6904ad9647914b68aff153d7b05bd6b1 [2021-10-11 02:23:05,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:23:05,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:23:05,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:05,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:23:05,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:23:05,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:05" (1/1) ... [2021-10-11 02:23:05,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca1a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:05, skipping insertion in model container [2021-10-11 02:23:05,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:05" (1/1) ... [2021-10-11 02:23:05,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:23:05,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:23:05,786 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-11 02:23:05,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:05,944 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:23:05,967 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2021-10-11 02:23:06,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:06,049 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:23:06,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06 WrapperNode [2021-10-11 02:23:06,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:06,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:06,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:23:06,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:23:06,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:06,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:23:06,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:23:06,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:23:06,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... [2021-10-11 02:23:06,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:23:06,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:23:06,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:23:06,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:23:06,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:23:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:23:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:23:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:23:06,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:23:06,662 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,684 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,693 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,714 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,716 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,720 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,732 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,738 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,745 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,746 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,750 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,757 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,758 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,761 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,763 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,770 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,773 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,778 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,782 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,784 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,787 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,790 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,791 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:06,792 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:23:07,828 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-11 02:23:07,828 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-11 02:23:07,829 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-11 02:23:07,831 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-11 02:23:07,831 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-11 02:23:07,832 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-11 02:23:07,832 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-11 02:23:07,832 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-11 02:23:07,832 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-11 02:23:07,832 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-11 02:23:07,834 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-11 02:23:07,834 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-11 02:23:07,835 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-11 02:23:07,835 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-11 02:23:07,835 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-11 02:23:07,835 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-11 02:23:07,836 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-11 02:23:07,836 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-11 02:23:07,836 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-11 02:23:07,836 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-11 02:23:07,837 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-11 02:23:07,837 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-11 02:23:07,837 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-11 02:23:07,837 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-11 02:23:07,838 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-11 02:23:07,838 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-11 02:23:07,839 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-11 02:23:07,839 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-11 02:23:07,840 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-11 02:23:07,840 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-11 02:23:07,840 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-11 02:23:07,840 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-11 02:23:07,841 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-11 02:23:07,841 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-11 02:23:07,841 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-11 02:23:07,842 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-11 02:23:07,842 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-11 02:23:07,842 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-11 02:23:07,842 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-11 02:23:07,842 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-11 02:23:07,843 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-11 02:23:07,843 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-11 02:23:07,843 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-11 02:23:07,843 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-11 02:23:07,843 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-11 02:23:07,844 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-11 02:23:07,844 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-11 02:23:07,845 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-11 02:23:08,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:23:08,966 INFO L299 CfgBuilder]: Removed 205 assume(true) statements. [2021-10-11 02:23:08,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:08 BoogieIcfgContainer [2021-10-11 02:23:08,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:23:08,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:23:08,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:23:08,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:23:08,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:23:05" (1/3) ... [2021-10-11 02:23:08,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c09bde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:08, skipping insertion in model container [2021-10-11 02:23:08,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:06" (2/3) ... [2021-10-11 02:23:08,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c09bde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:08, skipping insertion in model container [2021-10-11 02:23:08,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:08" (3/3) ... [2021-10-11 02:23:08,979 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-10-11 02:23:08,996 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:23:09,001 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2021-10-11 02:23:09,012 INFO L253 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-10-11 02:23:09,052 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:23:09,052 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:23:09,052 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:23:09,053 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:23:09,053 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:23:09,053 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:23:09,054 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:23:09,054 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2021-10-11 02:23:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:23:09,090 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:09,092 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1248492030, now seen corresponding path program 1 times [2021-10-11 02:23:09,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081697461] [2021-10-11 02:23:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:09,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081697461] [2021-10-11 02:23:09,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:09,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477350780] [2021-10-11 02:23:09,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:09,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:09,385 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2021-10-11 02:23:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,681 INFO L93 Difference]: Finished difference Result 480 states and 716 transitions. [2021-10-11 02:23:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:09,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-10-11 02:23:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,715 INFO L225 Difference]: With dead ends: 480 [2021-10-11 02:23:09,715 INFO L226 Difference]: Without dead ends: 256 [2021-10-11 02:23:09,722 INFO L677 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 [2021-10-11 02:23:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-11 02:23:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-11 02:23:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2021-10-11 02:23:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 340 transitions. [2021-10-11 02:23:09,774 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 340 transitions. Word has length 7 [2021-10-11 02:23:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,774 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 340 transitions. [2021-10-11 02:23:09,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 340 transitions. [2021-10-11 02:23:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:23:09,775 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:09,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:09,776 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1444791880, now seen corresponding path program 1 times [2021-10-11 02:23:09,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829129650] [2021-10-11 02:23:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:09,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829129650] [2021-10-11 02:23:09,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:09,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744822926] [2021-10-11 02:23:09,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:09,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:09,842 INFO L87 Difference]: Start difference. First operand 256 states and 340 transitions. Second operand 3 states. [2021-10-11 02:23:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,898 INFO L93 Difference]: Finished difference Result 472 states and 620 transitions. [2021-10-11 02:23:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:09,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-10-11 02:23:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,910 INFO L225 Difference]: With dead ends: 472 [2021-10-11 02:23:09,910 INFO L226 Difference]: Without dead ends: 330 [2021-10-11 02:23:09,914 INFO L677 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 [2021-10-11 02:23:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-11 02:23:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2021-10-11 02:23:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-10-11 02:23:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2021-10-11 02:23:09,953 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 9 [2021-10-11 02:23:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,953 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2021-10-11 02:23:09,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2021-10-11 02:23:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:23:09,954 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:09,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:23:09,955 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1704432536, now seen corresponding path program 1 times [2021-10-11 02:23:09,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367858657] [2021-10-11 02:23:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367858657] [2021-10-11 02:23:10,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:10,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361020318] [2021-10-11 02:23:10,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,035 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 3 states. [2021-10-11 02:23:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,052 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2021-10-11 02:23:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-10-11 02:23:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,054 INFO L225 Difference]: With dead ends: 263 [2021-10-11 02:23:10,054 INFO L226 Difference]: Without dead ends: 244 [2021-10-11 02:23:10,055 INFO L677 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 [2021-10-11 02:23:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-11 02:23:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-10-11 02:23:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-10-11 02:23:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 322 transitions. [2021-10-11 02:23:10,070 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 322 transitions. Word has length 10 [2021-10-11 02:23:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,071 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 322 transitions. [2021-10-11 02:23:10,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 322 transitions. [2021-10-11 02:23:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:23:10,072 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:23:10,073 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1430051866, now seen corresponding path program 1 times [2021-10-11 02:23:10,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208815263] [2021-10-11 02:23:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208815263] [2021-10-11 02:23:10,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119747614] [2021-10-11 02:23:10,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,144 INFO L87 Difference]: Start difference. First operand 244 states and 322 transitions. Second operand 3 states. [2021-10-11 02:23:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,175 INFO L93 Difference]: Finished difference Result 301 states and 390 transitions. [2021-10-11 02:23:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-10-11 02:23:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,178 INFO L225 Difference]: With dead ends: 301 [2021-10-11 02:23:10,181 INFO L226 Difference]: Without dead ends: 281 [2021-10-11 02:23:10,182 INFO L677 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 [2021-10-11 02:23:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-10-11 02:23:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2021-10-11 02:23:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2021-10-11 02:23:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 348 transitions. [2021-10-11 02:23:10,203 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 348 transitions. Word has length 13 [2021-10-11 02:23:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,203 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 348 transitions. [2021-10-11 02:23:10,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 348 transitions. [2021-10-11 02:23:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:23:10,211 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:23:10,212 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2037711640, now seen corresponding path program 1 times [2021-10-11 02:23:10,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078645691] [2021-10-11 02:23:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078645691] [2021-10-11 02:23:10,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:10,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436342400] [2021-10-11 02:23:10,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:10,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:10,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:10,320 INFO L87 Difference]: Start difference. First operand 262 states and 348 transitions. Second operand 4 states. [2021-10-11 02:23:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,355 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2021-10-11 02:23:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:10,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 02:23:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,357 INFO L225 Difference]: With dead ends: 325 [2021-10-11 02:23:10,357 INFO L226 Difference]: Without dead ends: 289 [2021-10-11 02:23:10,358 INFO L677 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 [2021-10-11 02:23:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-10-11 02:23:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2021-10-11 02:23:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-10-11 02:23:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 327 transitions. [2021-10-11 02:23:10,371 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 327 transitions. Word has length 16 [2021-10-11 02:23:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,371 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 327 transitions. [2021-10-11 02:23:10,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 327 transitions. [2021-10-11 02:23:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:23:10,372 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:23:10,373 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -524612469, now seen corresponding path program 1 times [2021-10-11 02:23:10,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643074222] [2021-10-11 02:23:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643074222] [2021-10-11 02:23:10,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495231867] [2021-10-11 02:23:10,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,406 INFO L87 Difference]: Start difference. First operand 249 states and 327 transitions. Second operand 3 states. [2021-10-11 02:23:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,604 INFO L93 Difference]: Finished difference Result 271 states and 353 transitions. [2021-10-11 02:23:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2021-10-11 02:23:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,607 INFO L225 Difference]: With dead ends: 271 [2021-10-11 02:23:10,608 INFO L226 Difference]: Without dead ends: 266 [2021-10-11 02:23:10,609 INFO L677 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 [2021-10-11 02:23:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-11 02:23:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-11 02:23:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-10-11 02:23:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 348 transitions. [2021-10-11 02:23:10,624 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 348 transitions. Word has length 16 [2021-10-11 02:23:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,625 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 348 transitions. [2021-10-11 02:23:10,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 348 transitions. [2021-10-11 02:23:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:10,626 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:23:10,628 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1662678360, now seen corresponding path program 1 times [2021-10-11 02:23:10,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274849455] [2021-10-11 02:23:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274849455] [2021-10-11 02:23:10,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213154985] [2021-10-11 02:23:10,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,677 INFO L87 Difference]: Start difference. First operand 266 states and 348 transitions. Second operand 3 states. [2021-10-11 02:23:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,842 INFO L93 Difference]: Finished difference Result 266 states and 348 transitions. [2021-10-11 02:23:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:10,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-10-11 02:23:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,848 INFO L225 Difference]: With dead ends: 266 [2021-10-11 02:23:10,848 INFO L226 Difference]: Without dead ends: 254 [2021-10-11 02:23:10,848 INFO L677 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 [2021-10-11 02:23:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-11 02:23:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-10-11 02:23:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-10-11 02:23:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 336 transitions. [2021-10-11 02:23:10,863 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 336 transitions. Word has length 17 [2021-10-11 02:23:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,863 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 336 transitions. [2021-10-11 02:23:10,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 336 transitions. [2021-10-11 02:23:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:10,864 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:10,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:23:10,867 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1852063148, now seen corresponding path program 1 times [2021-10-11 02:23:10,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775416982] [2021-10-11 02:23:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:10,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775416982] [2021-10-11 02:23:10,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:10,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407384848] [2021-10-11 02:23:10,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:10,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:10,923 INFO L87 Difference]: Start difference. First operand 254 states and 336 transitions. Second operand 3 states. [2021-10-11 02:23:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,077 INFO L93 Difference]: Finished difference Result 354 states and 469 transitions. [2021-10-11 02:23:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:11,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-10-11 02:23:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,080 INFO L225 Difference]: With dead ends: 354 [2021-10-11 02:23:11,080 INFO L226 Difference]: Without dead ends: 251 [2021-10-11 02:23:11,081 INFO L677 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 [2021-10-11 02:23:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-11 02:23:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-11 02:23:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-10-11 02:23:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 332 transitions. [2021-10-11 02:23:11,109 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 332 transitions. Word has length 17 [2021-10-11 02:23:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,110 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 332 transitions. [2021-10-11 02:23:11,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2021-10-11 02:23:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:11,111 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:23:11,111 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 934338714, now seen corresponding path program 1 times [2021-10-11 02:23:11,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701269081] [2021-10-11 02:23:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701269081] [2021-10-11 02:23:11,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:11,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300140753] [2021-10-11 02:23:11,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:11,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:11,173 INFO L87 Difference]: Start difference. First operand 251 states and 332 transitions. Second operand 4 states. [2021-10-11 02:23:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,225 INFO L93 Difference]: Finished difference Result 264 states and 346 transitions. [2021-10-11 02:23:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:11,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-10-11 02:23:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,227 INFO L225 Difference]: With dead ends: 264 [2021-10-11 02:23:11,227 INFO L226 Difference]: Without dead ends: 249 [2021-10-11 02:23:11,228 INFO L677 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 [2021-10-11 02:23:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-10-11 02:23:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-10-11 02:23:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-10-11 02:23:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2021-10-11 02:23:11,243 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 17 [2021-10-11 02:23:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,243 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2021-10-11 02:23:11,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2021-10-11 02:23:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:23:11,244 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:23:11,245 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1156557485, now seen corresponding path program 1 times [2021-10-11 02:23:11,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973476024] [2021-10-11 02:23:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973476024] [2021-10-11 02:23:11,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:11,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321932373] [2021-10-11 02:23:11,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:11,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:11,286 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand 3 states. [2021-10-11 02:23:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,324 INFO L93 Difference]: Finished difference Result 342 states and 443 transitions. [2021-10-11 02:23:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:11,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-10-11 02:23:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,326 INFO L225 Difference]: With dead ends: 342 [2021-10-11 02:23:11,326 INFO L226 Difference]: Without dead ends: 247 [2021-10-11 02:23:11,327 INFO L677 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 [2021-10-11 02:23:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-11 02:23:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2021-10-11 02:23:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-10-11 02:23:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 302 transitions. [2021-10-11 02:23:11,342 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 302 transitions. Word has length 18 [2021-10-11 02:23:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,342 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 302 transitions. [2021-10-11 02:23:11,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 302 transitions. [2021-10-11 02:23:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:23:11,343 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:23:11,343 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 748688567, now seen corresponding path program 1 times [2021-10-11 02:23:11,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615774513] [2021-10-11 02:23:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615774513] [2021-10-11 02:23:11,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:11,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590782119] [2021-10-11 02:23:11,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:11,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:11,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:11,385 INFO L87 Difference]: Start difference. First operand 233 states and 302 transitions. Second operand 3 states. [2021-10-11 02:23:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,557 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2021-10-11 02:23:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:11,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-10-11 02:23:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,561 INFO L225 Difference]: With dead ends: 304 [2021-10-11 02:23:11,561 INFO L226 Difference]: Without dead ends: 296 [2021-10-11 02:23:11,561 INFO L677 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 [2021-10-11 02:23:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-11 02:23:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 241. [2021-10-11 02:23:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-10-11 02:23:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 314 transitions. [2021-10-11 02:23:11,581 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 314 transitions. Word has length 19 [2021-10-11 02:23:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,581 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 314 transitions. [2021-10-11 02:23:11,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 314 transitions. [2021-10-11 02:23:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:23:11,582 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:23:11,582 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1726850595, now seen corresponding path program 1 times [2021-10-11 02:23:11,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130970254] [2021-10-11 02:23:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130970254] [2021-10-11 02:23:11,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:11,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707894293] [2021-10-11 02:23:11,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:11,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:11,635 INFO L87 Difference]: Start difference. First operand 241 states and 314 transitions. Second operand 4 states. [2021-10-11 02:23:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,837 INFO L93 Difference]: Finished difference Result 273 states and 351 transitions. [2021-10-11 02:23:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:11,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-10-11 02:23:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,839 INFO L225 Difference]: With dead ends: 273 [2021-10-11 02:23:11,839 INFO L226 Difference]: Without dead ends: 236 [2021-10-11 02:23:11,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-11 02:23:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-11 02:23:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2021-10-11 02:23:11,854 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 20 [2021-10-11 02:23:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,855 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2021-10-11 02:23:11,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2021-10-11 02:23:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:23:11,856 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:23:11,856 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 644980689, now seen corresponding path program 1 times [2021-10-11 02:23:11,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848430330] [2021-10-11 02:23:11,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:11,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848430330] [2021-10-11 02:23:11,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:11,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912054627] [2021-10-11 02:23:11,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:11,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:11,897 INFO L87 Difference]: Start difference. First operand 236 states and 306 transitions. Second operand 3 states. [2021-10-11 02:23:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,928 INFO L93 Difference]: Finished difference Result 353 states and 452 transitions. [2021-10-11 02:23:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:11,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-10-11 02:23:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,930 INFO L225 Difference]: With dead ends: 353 [2021-10-11 02:23:11,930 INFO L226 Difference]: Without dead ends: 259 [2021-10-11 02:23:11,935 INFO L677 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 [2021-10-11 02:23:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-10-11 02:23:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2021-10-11 02:23:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2021-10-11 02:23:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2021-10-11 02:23:11,950 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 20 [2021-10-11 02:23:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,950 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2021-10-11 02:23:11,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2021-10-11 02:23:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:23:11,951 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:11,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:23:11,951 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 348749927, now seen corresponding path program 1 times [2021-10-11 02:23:11,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568905037] [2021-10-11 02:23:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568905037] [2021-10-11 02:23:12,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:12,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483504477] [2021-10-11 02:23:12,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:12,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:12,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:12,072 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand 3 states. [2021-10-11 02:23:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,114 INFO L93 Difference]: Finished difference Result 324 states and 414 transitions. [2021-10-11 02:23:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:12,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 02:23:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,116 INFO L225 Difference]: With dead ends: 324 [2021-10-11 02:23:12,117 INFO L226 Difference]: Without dead ends: 226 [2021-10-11 02:23:12,118 INFO L677 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 [2021-10-11 02:23:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-11 02:23:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2021-10-11 02:23:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2021-10-11 02:23:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 270 transitions. [2021-10-11 02:23:12,133 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 270 transitions. Word has length 21 [2021-10-11 02:23:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,133 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 270 transitions. [2021-10-11 02:23:12,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2021-10-11 02:23:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:12,135 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:12,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:23:12,135 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,136 INFO L82 PathProgramCache]: Analyzing trace with hash -289492602, now seen corresponding path program 1 times [2021-10-11 02:23:12,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385344829] [2021-10-11 02:23:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385344829] [2021-10-11 02:23:12,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:12,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970367676] [2021-10-11 02:23:12,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:12,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:12,203 INFO L87 Difference]: Start difference. First operand 212 states and 270 transitions. Second operand 4 states. [2021-10-11 02:23:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,366 INFO L93 Difference]: Finished difference Result 298 states and 379 transitions. [2021-10-11 02:23:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-10-11 02:23:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,369 INFO L225 Difference]: With dead ends: 298 [2021-10-11 02:23:12,369 INFO L226 Difference]: Without dead ends: 212 [2021-10-11 02:23:12,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-11 02:23:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-10-11 02:23:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2021-10-11 02:23:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2021-10-11 02:23:12,393 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 22 [2021-10-11 02:23:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,394 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2021-10-11 02:23:12,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2021-10-11 02:23:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:23:12,397 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:12,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:23:12,397 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 336110457, now seen corresponding path program 1 times [2021-10-11 02:23:12,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085205722] [2021-10-11 02:23:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085205722] [2021-10-11 02:23:12,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:12,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484262053] [2021-10-11 02:23:12,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:12,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:12,487 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand 5 states. [2021-10-11 02:23:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,784 INFO L93 Difference]: Finished difference Result 278 states and 347 transitions. [2021-10-11 02:23:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:12,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-10-11 02:23:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,786 INFO L225 Difference]: With dead ends: 278 [2021-10-11 02:23:12,786 INFO L226 Difference]: Without dead ends: 274 [2021-10-11 02:23:12,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-11 02:23:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-10-11 02:23:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2021-10-11 02:23:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2021-10-11 02:23:12,806 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 23 [2021-10-11 02:23:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,806 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2021-10-11 02:23:12,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2021-10-11 02:23:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:12,807 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:12,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:23:12,808 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1926248536, now seen corresponding path program 1 times [2021-10-11 02:23:12,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240103635] [2021-10-11 02:23:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240103635] [2021-10-11 02:23:12,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:12,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650317207] [2021-10-11 02:23:12,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:12,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:12,852 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand 5 states. [2021-10-11 02:23:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,922 INFO L93 Difference]: Finished difference Result 226 states and 282 transitions. [2021-10-11 02:23:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:12,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2021-10-11 02:23:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,924 INFO L225 Difference]: With dead ends: 226 [2021-10-11 02:23:12,924 INFO L226 Difference]: Without dead ends: 202 [2021-10-11 02:23:12,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-11 02:23:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-11 02:23:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-10-11 02:23:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2021-10-11 02:23:12,941 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 24 [2021-10-11 02:23:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,941 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2021-10-11 02:23:12,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2021-10-11 02:23:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:12,942 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:12,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:23:12,942 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -561487128, now seen corresponding path program 1 times [2021-10-11 02:23:12,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404142840] [2021-10-11 02:23:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:12,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404142840] [2021-10-11 02:23:12,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:12,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610435464] [2021-10-11 02:23:12,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:12,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:12,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:12,982 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 3 states. [2021-10-11 02:23:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,104 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2021-10-11 02:23:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:13,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 02:23:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,107 INFO L225 Difference]: With dead ends: 240 [2021-10-11 02:23:13,107 INFO L226 Difference]: Without dead ends: 232 [2021-10-11 02:23:13,107 INFO L677 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 [2021-10-11 02:23:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-11 02:23:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2021-10-11 02:23:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-10-11 02:23:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 274 transitions. [2021-10-11 02:23:13,127 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 274 transitions. Word has length 24 [2021-10-11 02:23:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,127 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 274 transitions. [2021-10-11 02:23:13,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2021-10-11 02:23:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:13,128 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:13,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:23:13,129 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -208763799, now seen corresponding path program 1 times [2021-10-11 02:23:13,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022015322] [2021-10-11 02:23:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:13,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022015322] [2021-10-11 02:23:13,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:13,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:13,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688167704] [2021-10-11 02:23:13,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:13,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:13,172 INFO L87 Difference]: Start difference. First operand 222 states and 274 transitions. Second operand 5 states. [2021-10-11 02:23:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,352 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2021-10-11 02:23:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:13,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2021-10-11 02:23:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,354 INFO L225 Difference]: With dead ends: 249 [2021-10-11 02:23:13,354 INFO L226 Difference]: Without dead ends: 246 [2021-10-11 02:23:13,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-11 02:23:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2021-10-11 02:23:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2021-10-11 02:23:13,375 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 25 [2021-10-11 02:23:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,375 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2021-10-11 02:23:13,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2021-10-11 02:23:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:13,376 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:13,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:23:13,376 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash -208775715, now seen corresponding path program 1 times [2021-10-11 02:23:13,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990545909] [2021-10-11 02:23:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:13,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990545909] [2021-10-11 02:23:13,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:13,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:13,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346795954] [2021-10-11 02:23:13,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:13,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:13,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:13,417 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand 4 states. [2021-10-11 02:23:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,573 INFO L93 Difference]: Finished difference Result 256 states and 309 transitions. [2021-10-11 02:23:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:13,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-10-11 02:23:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,575 INFO L225 Difference]: With dead ends: 256 [2021-10-11 02:23:13,575 INFO L226 Difference]: Without dead ends: 246 [2021-10-11 02:23:13,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-11 02:23:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2021-10-11 02:23:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 289 transitions. [2021-10-11 02:23:13,597 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 289 transitions. Word has length 25 [2021-10-11 02:23:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,597 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 289 transitions. [2021-10-11 02:23:13,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 289 transitions. [2021-10-11 02:23:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:13,598 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:13,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 02:23:13,599 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1179076387, now seen corresponding path program 1 times [2021-10-11 02:23:13,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96429401] [2021-10-11 02:23:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:13,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96429401] [2021-10-11 02:23:13,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:13,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:13,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204969388] [2021-10-11 02:23:13,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:13,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:13,630 INFO L87 Difference]: Start difference. First operand 236 states and 289 transitions. Second operand 4 states. [2021-10-11 02:23:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:13,793 INFO L93 Difference]: Finished difference Result 276 states and 334 transitions. [2021-10-11 02:23:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:13,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-10-11 02:23:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:13,795 INFO L225 Difference]: With dead ends: 276 [2021-10-11 02:23:13,795 INFO L226 Difference]: Without dead ends: 236 [2021-10-11 02:23:13,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-11 02:23:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-10-11 02:23:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2021-10-11 02:23:13,818 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2021-10-11 02:23:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:13,819 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2021-10-11 02:23:13,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2021-10-11 02:23:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:13,819 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:13,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:13,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 02:23:13,820 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash -137400407, now seen corresponding path program 1 times [2021-10-11 02:23:13,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:13,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353747247] [2021-10-11 02:23:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:13,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353747247] [2021-10-11 02:23:13,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:13,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:13,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411049996] [2021-10-11 02:23:13,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:13,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:13,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:13,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:13,874 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 5 states. [2021-10-11 02:23:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:14,154 INFO L93 Difference]: Finished difference Result 256 states and 309 transitions. [2021-10-11 02:23:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:14,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2021-10-11 02:23:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:14,156 INFO L225 Difference]: With dead ends: 256 [2021-10-11 02:23:14,156 INFO L226 Difference]: Without dead ends: 254 [2021-10-11 02:23:14,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-11 02:23:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 236. [2021-10-11 02:23:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2021-10-11 02:23:14,184 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2021-10-11 02:23:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:14,184 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2021-10-11 02:23:14,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2021-10-11 02:23:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:14,185 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:14,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:14,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 02:23:14,186 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:14,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1588619095, now seen corresponding path program 1 times [2021-10-11 02:23:14,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:14,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429339135] [2021-10-11 02:23:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429339135] [2021-10-11 02:23:14,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:14,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:14,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011281332] [2021-10-11 02:23:14,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:14,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:14,222 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 4 states. [2021-10-11 02:23:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:14,390 INFO L93 Difference]: Finished difference Result 246 states and 292 transitions. [2021-10-11 02:23:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:14,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2021-10-11 02:23:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:14,392 INFO L225 Difference]: With dead ends: 246 [2021-10-11 02:23:14,392 INFO L226 Difference]: Without dead ends: 233 [2021-10-11 02:23:14,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-11 02:23:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2021-10-11 02:23:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-10-11 02:23:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 274 transitions. [2021-10-11 02:23:14,416 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 274 transitions. Word has length 26 [2021-10-11 02:23:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:14,416 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 274 transitions. [2021-10-11 02:23:14,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 274 transitions. [2021-10-11 02:23:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:14,417 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:14,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:14,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:23:14,417 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2125642541, now seen corresponding path program 1 times [2021-10-11 02:23:14,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:14,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023532494] [2021-10-11 02:23:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023532494] [2021-10-11 02:23:14,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:14,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:14,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687990223] [2021-10-11 02:23:14,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:14,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:14,460 INFO L87 Difference]: Start difference. First operand 230 states and 274 transitions. Second operand 3 states. [2021-10-11 02:23:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:14,581 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2021-10-11 02:23:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:14,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 02:23:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:14,583 INFO L225 Difference]: With dead ends: 248 [2021-10-11 02:23:14,583 INFO L226 Difference]: Without dead ends: 233 [2021-10-11 02:23:14,584 INFO L677 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 [2021-10-11 02:23:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-11 02:23:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2021-10-11 02:23:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-10-11 02:23:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2021-10-11 02:23:14,608 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 26 [2021-10-11 02:23:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:14,609 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2021-10-11 02:23:14,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2021-10-11 02:23:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:14,610 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:14,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:14,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 02:23:14,610 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1487865400, now seen corresponding path program 1 times [2021-10-11 02:23:14,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:14,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922774346] [2021-10-11 02:23:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922774346] [2021-10-11 02:23:14,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:14,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:14,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110065561] [2021-10-11 02:23:14,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:14,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:14,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:14,651 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 4 states. [2021-10-11 02:23:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:14,801 INFO L93 Difference]: Finished difference Result 233 states and 272 transitions. [2021-10-11 02:23:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:14,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-10-11 02:23:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:14,803 INFO L225 Difference]: With dead ends: 233 [2021-10-11 02:23:14,803 INFO L226 Difference]: Without dead ends: 214 [2021-10-11 02:23:14,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-11 02:23:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2021-10-11 02:23:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-10-11 02:23:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2021-10-11 02:23:14,840 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 27 [2021-10-11 02:23:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:14,840 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2021-10-11 02:23:14,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2021-10-11 02:23:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:14,841 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:14,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:14,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 02:23:14,841 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:14,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -569674545, now seen corresponding path program 1 times [2021-10-11 02:23:14,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:14,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370835108] [2021-10-11 02:23:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:14,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370835108] [2021-10-11 02:23:14,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:14,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:14,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794821712] [2021-10-11 02:23:14,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:14,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:14,907 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand 4 states. [2021-10-11 02:23:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:15,035 INFO L93 Difference]: Finished difference Result 241 states and 290 transitions. [2021-10-11 02:23:15,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:15,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-10-11 02:23:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:15,037 INFO L225 Difference]: With dead ends: 241 [2021-10-11 02:23:15,037 INFO L226 Difference]: Without dead ends: 235 [2021-10-11 02:23:15,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-11 02:23:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 195. [2021-10-11 02:23:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-10-11 02:23:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-10-11 02:23:15,058 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 27 [2021-10-11 02:23:15,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:15,058 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-10-11 02:23:15,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-10-11 02:23:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 02:23:15,059 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:15,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:15,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-11 02:23:15,060 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1052822710, now seen corresponding path program 1 times [2021-10-11 02:23:15,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217273935] [2021-10-11 02:23:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217273935] [2021-10-11 02:23:15,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:15,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:15,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658510638] [2021-10-11 02:23:15,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:15,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:15,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:15,106 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 4 states. [2021-10-11 02:23:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:15,239 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2021-10-11 02:23:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:15,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2021-10-11 02:23:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:15,241 INFO L225 Difference]: With dead ends: 200 [2021-10-11 02:23:15,241 INFO L226 Difference]: Without dead ends: 176 [2021-10-11 02:23:15,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-10-11 02:23:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-10-11 02:23:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-10-11 02:23:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2021-10-11 02:23:15,261 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 29 [2021-10-11 02:23:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:15,261 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2021-10-11 02:23:15,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2021-10-11 02:23:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:23:15,262 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:15,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:15,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-11 02:23:15,263 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1817096807, now seen corresponding path program 1 times [2021-10-11 02:23:15,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431794643] [2021-10-11 02:23:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431794643] [2021-10-11 02:23:15,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:15,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:15,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197041010] [2021-10-11 02:23:15,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:15,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:15,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:15,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:15,318 INFO L87 Difference]: Start difference. First operand 176 states and 206 transitions. Second operand 6 states. [2021-10-11 02:23:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:15,486 INFO L93 Difference]: Finished difference Result 192 states and 221 transitions. [2021-10-11 02:23:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:15,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2021-10-11 02:23:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:15,487 INFO L225 Difference]: With dead ends: 192 [2021-10-11 02:23:15,487 INFO L226 Difference]: Without dead ends: 118 [2021-10-11 02:23:15,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-11 02:23:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-10-11 02:23:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2021-10-11 02:23:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2021-10-11 02:23:15,500 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 30 [2021-10-11 02:23:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:15,500 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2021-10-11 02:23:15,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2021-10-11 02:23:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-11 02:23:15,501 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:15,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:15,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-11 02:23:15,501 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash 428263461, now seen corresponding path program 1 times [2021-10-11 02:23:15,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480060440] [2021-10-11 02:23:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480060440] [2021-10-11 02:23:15,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:15,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:23:15,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321401156] [2021-10-11 02:23:15,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:23:15,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:23:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:15,589 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 7 states. [2021-10-11 02:23:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:15,883 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2021-10-11 02:23:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:15,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2021-10-11 02:23:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:15,885 INFO L225 Difference]: With dead ends: 141 [2021-10-11 02:23:15,885 INFO L226 Difference]: Without dead ends: 139 [2021-10-11 02:23:15,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:23:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-10-11 02:23:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2021-10-11 02:23:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2021-10-11 02:23:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2021-10-11 02:23:15,901 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 33 [2021-10-11 02:23:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:15,901 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2021-10-11 02:23:15,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:23:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2021-10-11 02:23:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:23:15,902 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:15,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:15,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-11 02:23:15,903 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2090260494, now seen corresponding path program 1 times [2021-10-11 02:23:15,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:15,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085470136] [2021-10-11 02:23:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:15,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085470136] [2021-10-11 02:23:15,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:15,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:15,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607628578] [2021-10-11 02:23:15,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:15,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:15,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:15,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:15,992 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 5 states. [2021-10-11 02:23:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,135 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2021-10-11 02:23:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:16,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2021-10-11 02:23:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,136 INFO L225 Difference]: With dead ends: 135 [2021-10-11 02:23:16,137 INFO L226 Difference]: Without dead ends: 133 [2021-10-11 02:23:16,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-11 02:23:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2021-10-11 02:23:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-10-11 02:23:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-10-11 02:23:16,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 36 [2021-10-11 02:23:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,149 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-10-11 02:23:16,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-10-11 02:23:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:23:16,150 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,150 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-11 02:23:16,150 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1241346489, now seen corresponding path program 1 times [2021-10-11 02:23:16,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791898926] [2021-10-11 02:23:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791898926] [2021-10-11 02:23:16,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:16,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:16,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630474511] [2021-10-11 02:23:16,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:16,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:16,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:16,196 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 6 states. [2021-10-11 02:23:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,290 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2021-10-11 02:23:16,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:16,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2021-10-11 02:23:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,291 INFO L225 Difference]: With dead ends: 104 [2021-10-11 02:23:16,291 INFO L226 Difference]: Without dead ends: 88 [2021-10-11 02:23:16,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:23:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-10-11 02:23:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-10-11 02:23:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-10-11 02:23:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2021-10-11 02:23:16,303 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 37 [2021-10-11 02:23:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,303 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2021-10-11 02:23:16,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2021-10-11 02:23:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:23:16,304 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-11 02:23:16,305 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1311713020, now seen corresponding path program 1 times [2021-10-11 02:23:16,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642363856] [2021-10-11 02:23:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642363856] [2021-10-11 02:23:16,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:16,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:16,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179343179] [2021-10-11 02:23:16,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:16,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:16,359 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 6 states. [2021-10-11 02:23:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,461 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2021-10-11 02:23:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:16,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2021-10-11 02:23:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,462 INFO L225 Difference]: With dead ends: 108 [2021-10-11 02:23:16,462 INFO L226 Difference]: Without dead ends: 90 [2021-10-11 02:23:16,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-11 02:23:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-10-11 02:23:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-10-11 02:23:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2021-10-11 02:23:16,495 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 37 [2021-10-11 02:23:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,496 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2021-10-11 02:23:16,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2021-10-11 02:23:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:23:16,496 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-11 02:23:16,498 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1139615357, now seen corresponding path program 1 times [2021-10-11 02:23:16,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297522972] [2021-10-11 02:23:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297522972] [2021-10-11 02:23:16,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:16,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-11 02:23:16,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485269999] [2021-10-11 02:23:16,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:23:16,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:23:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:23:16,581 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 8 states. [2021-10-11 02:23:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,702 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-10-11 02:23:16,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:16,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2021-10-11 02:23:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,704 INFO L225 Difference]: With dead ends: 104 [2021-10-11 02:23:16,704 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 02:23:16,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 02:23:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-11 02:23:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:23:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-10-11 02:23:16,715 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 40 [2021-10-11 02:23:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,715 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-10-11 02:23:16,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:23:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-10-11 02:23:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:23:16,716 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-11 02:23:16,717 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1936797695, now seen corresponding path program 1 times [2021-10-11 02:23:16,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999618718] [2021-10-11 02:23:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999618718] [2021-10-11 02:23:16,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:16,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:16,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769918281] [2021-10-11 02:23:16,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:16,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:16,756 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 4 states. [2021-10-11 02:23:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,801 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2021-10-11 02:23:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:16,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-10-11 02:23:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,802 INFO L225 Difference]: With dead ends: 94 [2021-10-11 02:23:16,802 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 02:23:16,803 INFO L677 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 [2021-10-11 02:23:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 02:23:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-11 02:23:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:23:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2021-10-11 02:23:16,813 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 40 [2021-10-11 02:23:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,814 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2021-10-11 02:23:16,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2021-10-11 02:23:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-11 02:23:16,814 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-11 02:23:16,815 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 427795179, now seen corresponding path program 1 times [2021-10-11 02:23:16,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:16,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371045515] [2021-10-11 02:23:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:16,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371045515] [2021-10-11 02:23:16,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:16,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:16,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570823180] [2021-10-11 02:23:16,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:16,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:16,877 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 6 states. [2021-10-11 02:23:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:16,986 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-10-11 02:23:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:16,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2021-10-11 02:23:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:16,987 INFO L225 Difference]: With dead ends: 84 [2021-10-11 02:23:16,987 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 02:23:16,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 02:23:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-11 02:23:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:23:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-10-11 02:23:16,998 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 49 [2021-10-11 02:23:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:16,998 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-10-11 02:23:16,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-10-11 02:23:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:23:16,999 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:16,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:16,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-11 02:23:16,999 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash 189508487, now seen corresponding path program 1 times [2021-10-11 02:23:17,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:17,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938367745] [2021-10-11 02:23:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:17,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938367745] [2021-10-11 02:23:17,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:17,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-11 02:23:17,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333339333] [2021-10-11 02:23:17,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:17,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:17,127 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2021-10-11 02:23:17,481 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-10-11 02:23:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:17,595 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-10-11 02:23:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:17,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2021-10-11 02:23:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:17,596 INFO L225 Difference]: With dead ends: 89 [2021-10-11 02:23:17,596 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 02:23:17,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:23:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 02:23:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-11 02:23:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 02:23:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2021-10-11 02:23:17,611 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 51 [2021-10-11 02:23:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:17,611 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2021-10-11 02:23:17,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2021-10-11 02:23:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-11 02:23:17,612 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:17,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:17,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-11 02:23:17,613 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:17,613 INFO L82 PathProgramCache]: Analyzing trace with hash 976715016, now seen corresponding path program 1 times [2021-10-11 02:23:17,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:17,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195469965] [2021-10-11 02:23:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:17,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195469965] [2021-10-11 02:23:17,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:17,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-11 02:23:17,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616938184] [2021-10-11 02:23:17,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:17,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:17,754 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2021-10-11 02:23:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:18,006 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2021-10-11 02:23:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:23:18,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2021-10-11 02:23:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:18,007 INFO L225 Difference]: With dead ends: 80 [2021-10-11 02:23:18,007 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:23:18,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:23:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:23:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:23:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:23:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:23:18,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-10-11 02:23:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:18,008 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:23:18,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:23:18,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:23:18,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-11 02:23:18,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:23:18,296 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 144 [2021-10-11 02:23:19,478 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-10-11 02:23:19,676 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2021-10-11 02:23:19,915 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2021-10-11 02:23:20,208 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2021-10-11 02:23:21,014 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 83 [2021-10-11 02:23:21,653 WARN L197 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 88 [2021-10-11 02:23:22,151 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2021-10-11 02:23:22,280 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2021-10-11 02:23:22,774 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 81 [2021-10-11 02:23:23,276 WARN L197 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2021-10-11 02:23:23,904 WARN L197 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 106 [2021-10-11 02:23:24,364 WARN L197 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2021-10-11 02:23:24,841 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2021-10-11 02:23:25,273 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2021-10-11 02:23:25,901 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 81 [2021-10-11 02:23:26,096 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-10-11 02:23:26,404 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-10-11 02:23:27,368 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 110 [2021-10-11 02:23:27,978 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2021-10-11 02:23:28,689 WARN L197 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 110 [2021-10-11 02:23:28,933 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2021-10-11 02:23:29,065 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,066 INFO L262 CegarLoopResult]: For program point L630(lines 630 632) no Hoare annotation was computed. [2021-10-11 02:23:29,066 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,066 INFO L262 CegarLoopResult]: For program point L565(lines 565 567) no Hoare annotation was computed. [2021-10-11 02:23:29,066 INFO L262 CegarLoopResult]: For program point L499(lines 499 505) no Hoare annotation was computed. [2021-10-11 02:23:29,066 INFO L258 CegarLoopResult]: At program point L499-1(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~compRegistered~0 1)) [2021-10-11 02:23:29,067 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,067 INFO L258 CegarLoopResult]: At program point L434(lines 163 436) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2))) (let ((.cse7 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse9 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse14 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse12 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse15 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse13 (<= |ULTIMATE.start_FloppyPnp_#res| 258)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= .cse21 ~SKIP2~0)) (.cse5 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse8 (= ~s~0 ~DC~0)) (.cse10 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= ~pended~0 0)) (.cse16 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse19 (<= .cse21 ~s~0)) (.cse20 (= ~SKIP2~0 ~s~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse17 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse18 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~myStatus~0 259)) .cse9 .cse10 .cse11) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse12) .cse0 .cse1 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse2 .cse3 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) .cse13) .cse4 .cse5 .cse6 (or .cse14 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse8 (or .cse15 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse10 .cse11 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse0 .cse6 .cse2 (= ~IPC~0 ~s~0) .cse16 .cse4 .cse11 .cse17 .cse18 (<= (+ ~DC~0 5) ~s~0)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse2 .cse8 .cse4 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0)) (and .cse6 .cse8 .cse4 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse17 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0)) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse12 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse6 .cse15 .cse8 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse6 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse19 .cse4 .cse20 .cse5 .cse10 .cse11 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse8 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse10 .cse11 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse6 .cse2 .cse16 .cse19 .cse20 .cse4 .cse11 .cse17 .cse18)))) [2021-10-11 02:23:29,068 INFO L258 CegarLoopResult]: At program point L765(lines 758 804) the Hoare annotation is: (let ((.cse20 (+ ~DC~0 2))) (let ((.cse8 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse9 (not (= 259 ULTIMATE.start_main_~status~1))) (.cse10 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse3 (<= .cse20 ~SKIP2~0)) (.cse19 (<= |ULTIMATE.start_FloppyPnp_#res| 258)) (.cse5 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse6 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (<= ULTIMATE.start_main_~status~1 258)) (.cse4 (= ~s~0 ~DC~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse7 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse14 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~status~1 0) .cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse4 .cse5 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse6 .cse7 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 (not (= ~myStatus~0 259)) .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 (= ~IPC~0 ~s~0) .cse11 .cse12 .cse7 .cse13 .cse14 (<= (+ ~DC~0 5) ~s~0)) (and .cse0 .cse1 .cse15 .cse3 .cse5 .cse16 .cse17 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse2 .cse4 .cse18 .cse6 .cse7 .cse19) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse17) .cse0 .cse1 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) .cse19) .cse5 .cse2 (or .cse15 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse4 (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 ULTIMATE.start_main_~status~1) .cse16)) (and .cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0)) (and .cse0 .cse2 .cse11 (<= .cse20 ~s~0) (= ~SKIP2~0 ~s~0) .cse12 .cse7 .cse13 .cse14)))) [2021-10-11 02:23:29,068 INFO L265 CegarLoopResult]: At program point L766(lines 750 805) the Hoare annotation is: true [2021-10-11 02:23:29,068 INFO L262 CegarLoopResult]: For program point L304(lines 304 310) no Hoare annotation was computed. [2021-10-11 02:23:29,069 INFO L262 CegarLoopResult]: For program point L767(lines 767 802) no Hoare annotation was computed. [2021-10-11 02:23:29,069 INFO L262 CegarLoopResult]: For program point L239-1(lines 232 420) no Hoare annotation was computed. [2021-10-11 02:23:29,069 INFO L262 CegarLoopResult]: For program point L768(lines 768 801) no Hoare annotation was computed. [2021-10-11 02:23:29,069 INFO L258 CegarLoopResult]: At program point L570(lines 531 596) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse13 (not (= ~myStatus~0 259))) (.cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse12 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~pended~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 0 .cse16)) (.cse9 (<= .cse16 0)) (.cse10 (= ~compRegistered~0 1)) (.cse11 (<= (+ ~s~0 5) ~MPR3~0)) (.cse15 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse0) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or .cse14 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse15 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse12 .cse14 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse15 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:29,069 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,069 INFO L262 CegarLoopResult]: For program point L769(lines 769 779) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L770(lines 770 776) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L1036(lines 1036 1055) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L1036-1(lines 1036 1055) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L1036-2(lines 1036 1055) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L1036-3(lines 1036 1055) no Hoare annotation was computed. [2021-10-11 02:23:29,070 INFO L262 CegarLoopResult]: For program point L640(lines 640 645) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point L640-2(lines 640 645) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point L1037(lines 1037 1042) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point L1037-2(lines 1037 1042) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point L1037-4(lines 1037 1042) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point L1037-6(lines 1037 1042) no Hoare annotation was computed. [2021-10-11 02:23:29,071 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,072 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,072 INFO L262 CegarLoopResult]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-10-11 02:23:29,072 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,072 INFO L258 CegarLoopResult]: At program point L710(lines 704 808) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2))) (let ((.cse17 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse19 (<= ULTIMATE.start_main_~status~1 258)) (.cse14 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse16 (<= |ULTIMATE.start_FloppyPnp_#res| 258)) (.cse3 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= .cse23 ~s~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (= ~pended~0 0)) (.cse15 (<= .cse23 ~SKIP2~0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse20 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse21 (not (= 259 ULTIMATE.start_main_~status~1))) (.cse13 (= ~s~0 ~DC~0)) (.cse22 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and .cse0 .cse1 .cse2 (= ~IPC~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~DC~0 5) ~s~0)) (and .cse0 .cse8 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse11 .cse4 .cse12 .cse5 .cse7) (and .cse1 .cse13 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse6 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= (+ ULTIMATE.start_main_~status~1 1073741823) 0)) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse14) .cse0 .cse8 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse2 .cse15 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) .cse16) .cse11 .cse1 (or .cse17 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse13 (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse12 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 ULTIMATE.start_main_~status~1) .cse19)) (and .cse0 .cse8 .cse2 .cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse11 .cse1 .cse20 .cse21 .cse13 .cse22 .cse12 .cse5) (and .cse0 .cse8 .cse17 .cse2 .cse15 .cse11 .cse19 .cse14 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse1 .cse18 .cse13 .cse12 .cse5 .cse16) (and .cse2 .cse13 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse1 (<= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse13 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse12 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse1 .cse20 .cse21 .cse13 (not (= ~myStatus~0 259)) .cse22 .cse12 .cse5)))) [2021-10-11 02:23:29,073 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,073 INFO L262 CegarLoopResult]: For program point L380(lines 380 386) no Hoare annotation was computed. [2021-10-11 02:23:29,073 INFO L258 CegarLoopResult]: At program point L647(lines 615 649) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= ~pended~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= 0 .cse15)) (.cse8 (<= .cse15 0)) (.cse9 (= ~compRegistered~0 1)) (.cse10 (<= (+ ~s~0 5) ~MPR3~0)) (.cse13 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse11 (not (= ~myStatus~0 259))) (.cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse11 .cse12 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse13 .cse14 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse12) (and .cse0 .cse1 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 (or .cse14 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse12 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) [2021-10-11 02:23:29,073 INFO L262 CegarLoopResult]: For program point L515(lines 515 520) no Hoare annotation was computed. [2021-10-11 02:23:29,073 INFO L258 CegarLoopResult]: At program point L515-2(lines 515 520) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~s~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,073 INFO L258 CegarLoopResult]: At program point L1044(lines 1036 1055) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L1044-1(lines 1036 1055) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L1044-2(lines 1036 1055) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L1044-3(lines 1036 1055) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L979(lines 943 1007) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L979-1(lines 943 1007) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L979-2(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-11 02:23:29,074 INFO L258 CegarLoopResult]: At program point L979-3(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L979-4(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L979-5(lines 943 1007) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L979-6(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L781(lines 768 801) the Hoare annotation is: (let ((.cse16 (= ~s~0 ~DC~0)) (.cse12 (+ ~DC~0 5)) (.cse2 (+ ~DC~0 2))) (let ((.cse11 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse9 (<= |ULTIMATE.start_FloppyPnp_#res| 258)) (.cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse8 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse10 (<= ULTIMATE.start_main_~status~1 258)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= .cse2 ~SKIP2~0)) (.cse13 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse14 (not (= 259 ULTIMATE.start_main_~status~1))) (.cse3 (<= .cse12 ~IPC~0)) (.cse15 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse5 (let ((.cse17 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse19 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse17 .cse18 .cse16 .cse19) (and .cse17 .cse18 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse19 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)))))) (or (and .cse0 .cse1 (<= .cse2 ~s~0) .cse3 .cse4 .cse5) (and .cse6 .cse0 (<= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse1 .cse3 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse4 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse6 .cse0 .cse7 .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse10 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0))) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse11) .cse6 .cse0 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse1 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) .cse9) .cse3 (or .cse7 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) (or .cse8 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse4 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse5 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 ULTIMATE.start_main_~status~1) .cse10)) (and .cse0 .cse3 .cse4 .cse5 (<= .cse12 ~s~0)) (and .cse6 .cse0 .cse1 .cse13 .cse14 (not (= ~myStatus~0 259)) .cse3 .cse15 .cse4 .cse5) (and .cse16 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0)) (and .cse6 .cse0 .cse1 .cse13 .cse14 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse3 .cse15 .cse4 .cse5)))) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L979-7(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,075 INFO L258 CegarLoopResult]: At program point L979-8(lines 943 1007) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,075 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L258 CegarLoopResult]: At program point L121(lines 121 151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L121-2(lines 113 161) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L322(lines 322 334) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L1049(lines 1049 1053) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L258 CegarLoopResult]: At program point L1049-1(lines 1049 1053) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L1049-2(lines 1049 1053) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L258 CegarLoopResult]: At program point L1049-3(lines 1049 1053) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))) [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L1049-4(lines 1049 1053) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L258 CegarLoopResult]: At program point L1049-5(lines 1049 1053) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,076 INFO L262 CegarLoopResult]: For program point L1049-6(lines 1049 1053) no Hoare annotation was computed. [2021-10-11 02:23:29,076 INFO L258 CegarLoopResult]: At program point L1049-7(lines 1049 1053) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L787(lines 787 799) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L788(lines 788 792) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-1(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-2(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-3(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-4(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-5(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-6(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-7(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L987-8(lines 987 1004) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L262 CegarLoopResult]: For program point L327(lines 327 333) no Hoare annotation was computed. [2021-10-11 02:23:29,077 INFO L258 CegarLoopResult]: At program point L327-1(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~compRegistered~0 1)) [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L263(lines 263 294) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-1(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-2(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-3(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-4(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-5(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-6(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-7(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-8(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-9(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-10(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-11(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-12(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-13(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-14(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-15(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,078 INFO L262 CegarLoopResult]: For program point L65-16(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-17(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-18(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-19(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-20(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-21(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-22(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-23(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-24(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-25(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-26(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-27(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L262 CegarLoopResult]: For program point L65-28(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,079 INFO L258 CegarLoopResult]: At program point L132(lines 132 139) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-29(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-30(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,080 INFO L258 CegarLoopResult]: At program point L66(lines 1009 1022) the Hoare annotation is: (and (= ~pended~0 0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~DC~0 ~s~0)) [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-31(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-32(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-33(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,080 INFO L262 CegarLoopResult]: For program point L65-34(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,081 INFO L258 CegarLoopResult]: At program point L66-4(lines 1 1151) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= ~s~0 ~NP~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (= ~MPR3~0 ~s~0) .cse1) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,081 INFO L262 CegarLoopResult]: For program point L65-35(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,081 INFO L262 CegarLoopResult]: For program point L65-36(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,081 INFO L262 CegarLoopResult]: For program point L65-37(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,081 INFO L258 CegarLoopResult]: At program point L66-7(lines 1 1151) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= ~s~0 ~NP~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (= ~MPR3~0 ~s~0) .cse1) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) [2021-10-11 02:23:29,081 INFO L262 CegarLoopResult]: For program point L65-38(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,082 INFO L262 CegarLoopResult]: For program point L65-39(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,082 INFO L258 CegarLoopResult]: At program point L66-9(lines 1009 1022) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse13 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse2 (= ~pended~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 0 .cse16)) (.cse7 (<= .cse16 0)) (.cse8 (= ~compRegistered~0 1)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse10 (= ~s~0 ~DC~0)) (.cse15 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse11 .cse12 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse9 .cse14 .cse10 .cse15 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse1 (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse13) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 (or .cse15 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse12 .cse11 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)))))) [2021-10-11 02:23:29,082 INFO L258 CegarLoopResult]: At program point L66-10(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-11 02:23:29,082 INFO L258 CegarLoopResult]: At program point L66-12(lines 1 1151) the Hoare annotation is: (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= ~pended~0 0)) (.cse3 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (= ~compRegistered~0 0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 (= ~IPC~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~DC~0 5) ~s~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 2) ~s~0) (= ~SKIP2~0 ~s~0) .cse5 .cse6 .cse7))) [2021-10-11 02:23:29,083 INFO L258 CegarLoopResult]: At program point L66-13(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,083 INFO L258 CegarLoopResult]: At program point L66-15(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,083 INFO L258 CegarLoopResult]: At program point L66-17(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~compRegistered~0 0) (<= (+ ~DC~0 2) ~s~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,083 INFO L258 CegarLoopResult]: At program point L66-19(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,083 INFO L258 CegarLoopResult]: At program point L66-21(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ ~DC~0 2) ~s~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,084 INFO L258 CegarLoopResult]: At program point L66-25(lines 1 1151) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= ~s~0 ~NP~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (or .cse1 (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (= ~myStatus~0 0) (or (= ~MPR3~0 ~s~0) .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,084 INFO L258 CegarLoopResult]: At program point L66-28(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,084 INFO L258 CegarLoopResult]: At program point L66-30(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ ~DC~0 2) ~s~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,084 INFO L258 CegarLoopResult]: At program point L66-31(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,085 INFO L258 CegarLoopResult]: At program point L66-33(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ ~DC~0 2) ~s~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,085 INFO L258 CegarLoopResult]: At program point L66-34(lines 1 1151) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,085 INFO L262 CegarLoopResult]: For program point L926(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,085 INFO L258 CegarLoopResult]: At program point L66-36(lines 1 1151) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (= ~compRegistered~0 0) (<= (+ ~DC~0 2) ~s~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP2~0 ~s~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,085 INFO L262 CegarLoopResult]: For program point L926-2(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,085 INFO L262 CegarLoopResult]: For program point L926-4(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,085 INFO L262 CegarLoopResult]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-6(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-8(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-10(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-12(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-14(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L926-16(lines 926 932) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L531(lines 531 596) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L531-1(lines 531 596) no Hoare annotation was computed. [2021-10-11 02:23:29,086 INFO L262 CegarLoopResult]: For program point L201(lines 201 209) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point L533(lines 533 573) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point L996(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point L996-2(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point L996-4(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,087 INFO L262 CegarLoopResult]: For program point L996-6(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,088 INFO L262 CegarLoopResult]: For program point L996-8(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,088 INFO L262 CegarLoopResult]: For program point L996-10(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,088 INFO L262 CegarLoopResult]: For program point L996-12(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,088 INFO L258 CegarLoopResult]: At program point L534(lines 534 544) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~pended~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 0 .cse15)) (.cse9 (<= .cse15 0)) (.cse10 (= ~compRegistered~0 1)) (.cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse11 (<= (+ ~s~0 5) ~MPR3~0)) (.cse12 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse13 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse14 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse0) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~myStatus~0 259)) (or .cse13 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse12 .cse13 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse14)))) [2021-10-11 02:23:29,088 INFO L262 CegarLoopResult]: For program point L996-14(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,088 INFO L262 CegarLoopResult]: For program point L996-16(lines 996 1003) no Hoare annotation was computed. [2021-10-11 02:23:29,089 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,089 INFO L258 CegarLoopResult]: At program point L733(lines 733 748) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,089 INFO L258 CegarLoopResult]: At program point L667(lines 727 729) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,089 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,089 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,089 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,089 INFO L262 CegarLoopResult]: For program point L274(lines 274 280) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L258 CegarLoopResult]: At program point L210(lines 210 429) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,090 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L262 CegarLoopResult]: For program point L343(lines 343 348) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L262 CegarLoopResult]: For program point L343-2(lines 343 348) no Hoare annotation was computed. [2021-10-11 02:23:29,090 INFO L265 CegarLoopResult]: At program point L807(lines 670 809) the Hoare annotation is: true [2021-10-11 02:23:29,091 INFO L262 CegarLoopResult]: For program point L213(lines 213 428) no Hoare annotation was computed. [2021-10-11 02:23:29,091 INFO L262 CegarLoopResult]: For program point L147(lines 147 149) no Hoare annotation was computed. [2021-10-11 02:23:29,091 INFO L258 CegarLoopResult]: At program point L546(lines 533 573) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~pended~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 0 .cse15)) (.cse9 (<= .cse15 0)) (.cse10 (= ~compRegistered~0 1)) (.cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse11 (<= (+ ~s~0 5) ~MPR3~0)) (.cse12 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse13 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse14 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse0) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~myStatus~0 259)) (or .cse13 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse14 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse12 .cse13 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse14)))) [2021-10-11 02:23:29,091 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,091 INFO L262 CegarLoopResult]: For program point L216(lines 216 427) no Hoare annotation was computed. [2021-10-11 02:23:29,091 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,092 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,092 INFO L258 CegarLoopResult]: At program point L217(lines 213 428) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,092 INFO L258 CegarLoopResult]: At program point L944(lines 944 956) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~compRegistered~0 1)) [2021-10-11 02:23:29,092 INFO L258 CegarLoopResult]: At program point L944-1(lines 944 956) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,093 INFO L258 CegarLoopResult]: At program point L944-2(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~compRegistered~0 1) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,093 INFO L258 CegarLoopResult]: At program point L944-3(lines 944 956) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,093 INFO L258 CegarLoopResult]: At program point L944-4(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-11 02:23:29,093 INFO L258 CegarLoopResult]: At program point L944-5(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-11 02:23:29,093 INFO L258 CegarLoopResult]: At program point L944-6(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,094 INFO L258 CegarLoopResult]: At program point L944-7(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,094 INFO L258 CegarLoopResult]: At program point L944-8(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,094 INFO L258 CegarLoopResult]: At program point L944-9(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,094 INFO L258 CegarLoopResult]: At program point L944-10(lines 944 956) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (= ~compRegistered~0 1)) [2021-10-11 02:23:29,094 INFO L258 CegarLoopResult]: At program point L944-11(lines 944 956) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ~myStatus~0 0) (<= (+ ~SKIP2~0 3) ~IPC~0))) [2021-10-11 02:23:29,095 INFO L258 CegarLoopResult]: At program point L944-12(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,095 INFO L258 CegarLoopResult]: At program point L944-13(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,095 INFO L258 CegarLoopResult]: At program point L944-14(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,095 INFO L258 CegarLoopResult]: At program point L944-15(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,095 INFO L258 CegarLoopResult]: At program point L944-16(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,096 INFO L258 CegarLoopResult]: At program point L944-17(lines 944 956) the Hoare annotation is: (and (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (<= (+ ~NP~0 2) ~s~0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,096 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:23:29,096 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,096 INFO L262 CegarLoopResult]: For program point L219(lines 219 426) no Hoare annotation was computed. [2021-10-11 02:23:29,096 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,096 INFO L258 CegarLoopResult]: At program point L88(lines 710 749) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~myStatus~0 0) (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,096 INFO L262 CegarLoopResult]: For program point L1013(lines 1013 1019) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point L1013-2(lines 1013 1019) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point L1013-4(lines 1013 1019) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point L1013-6(lines 1013 1019) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point L222(lines 222 425) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,097 INFO L262 CegarLoopResult]: For program point L751(lines 751 755) no Hoare annotation was computed. [2021-10-11 02:23:29,098 INFO L258 CegarLoopResult]: At program point L553-2(lines 553 569) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~pended~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 0 .cse16)) (.cse9 (<= .cse16 0)) (.cse10 (= ~compRegistered~0 1)) (.cse11 (<= (+ ~s~0 5) ~MPR3~0)) (.cse12 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse13 (not (= ~myStatus~0 259))) (.cse15 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse0) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or .cse14 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse15 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse12 .cse14 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:29,098 INFO L258 CegarLoopResult]: At program point L421(lines 232 422) the Hoare annotation is: (let ((.cse14 (+ ~DC~0 2))) (let ((.cse9 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse10 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (= ~pended~0 0)) (.cse7 (<= .cse14 ~SKIP2~0)) (.cse13 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse1 (= ~s~0 ~DC~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse12 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and .cse0 .cse1 .cse2 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse0 .cse10 .cse1 .cse11 .cse12) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse9) .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse6 .cse7 .cse2 .cse8 .cse0 (or .cse5 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse1 (or .cse10 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse11 .cse12 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse3 .cse4 .cse0 .cse6 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse7 .cse1 .cse2 .cse8 .cse11 .cse12 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse3 .cse4 .cse0 .cse6 .cse7 .cse13 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse2 .cse8 .cse11 .cse12) (and .cse3 .cse4 .cse0 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= .cse14 ~s~0) .cse2 (= ~SKIP2~0 ~s~0) .cse8 .cse11 .cse12) (and .cse3 .cse4 .cse0 .cse6 .cse7 .cse13 .cse1 (not (= ~myStatus~0 259)) .cse2 .cse8 .cse11 .cse12)))) [2021-10-11 02:23:29,099 INFO L258 CegarLoopResult]: At program point L223(lines 219 426) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ~compRegistered~0 0) (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0)) [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950-2(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950-4(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950-6(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950-8(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,099 INFO L262 CegarLoopResult]: For program point L950-10(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,100 INFO L258 CegarLoopResult]: At program point L554(lines 553 569) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse1 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~pended~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (= ~s~0 ~NP~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= 0 .cse16)) (.cse9 (<= .cse16 0)) (.cse10 (= ~compRegistered~0 1)) (.cse11 (<= (+ ~s~0 5) ~MPR3~0)) (.cse12 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse13 (not (= ~myStatus~0 259))) (.cse15 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse0) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or .cse14 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse15 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse12 .cse14 (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:29,100 INFO L262 CegarLoopResult]: For program point L950-12(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,100 INFO L262 CegarLoopResult]: For program point L950-14(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,100 INFO L262 CegarLoopResult]: For program point L950-16(lines 950 954) no Hoare annotation was computed. [2021-10-11 02:23:29,100 INFO L258 CegarLoopResult]: At program point L225(lines 225 424) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,100 INFO L258 CegarLoopResult]: At program point L160(lines 100 162) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 0)) (.cse1 (= ~s~0 ~NP~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= (+ ~s~0 5) ~MPR3~0))) (or (and (= ~pended~0 0) .cse0 .cse1 .cse2 (<= (+ ~NP~0 4) ~MPR1~0) (not (= 259 |ULTIMATE.start_FlQueueIrpToThread_#res|)) .cse3) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 2) ~SKIP2~0) .cse0 .cse1 .cse2 (<= (+ ~SKIP2~0 3) ~IPC~0) .cse3))) [2021-10-11 02:23:29,101 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,101 INFO L258 CegarLoopResult]: At program point L228(lines 228 423) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,101 INFO L258 CegarLoopResult]: At program point L757(lines 750 805) the Hoare annotation is: (let ((.cse23 (+ ~DC~0 2))) (let ((.cse17 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse19 (<= ULTIMATE.start_main_~status~1 258)) (.cse14 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258)) (.cse18 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) (.cse16 (<= |ULTIMATE.start_FloppyPnp_#res| 258)) (.cse3 (= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse9 (<= .cse23 ~s~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (= ~pended~0 0)) (.cse15 (<= .cse23 ~SKIP2~0)) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse20 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse21 (not (= 259 ULTIMATE.start_main_~status~1))) (.cse13 (= ~s~0 ~DC~0)) (.cse22 (not (= 259 |ULTIMATE.start_FloppyPnp_#res|))) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0))) (or (and .cse0 .cse1 .cse2 (= ~IPC~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~DC~0 5) ~s~0)) (and .cse0 .cse8 .cse1 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse9 .cse10 .cse11 .cse4 .cse12 .cse5 .cse7) (and .cse1 .cse13 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse6 (= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741823) 0) (= (+ ULTIMATE.start_main_~status~1 1073741823) 0)) (and (or (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1) .cse14) .cse0 .cse8 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2)) .cse2 .cse15 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) .cse16) .cse11 .cse1 (or .cse17 (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0)) .cse13 (or .cse18 (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|)) .cse12 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 ULTIMATE.start_main_~status~1) .cse19)) (and .cse0 .cse8 .cse2 .cse15 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) .cse11 .cse1 .cse20 .cse21 .cse13 .cse22 .cse12 .cse5) (and .cse0 .cse8 .cse17 .cse2 .cse15 .cse11 .cse19 .cse14 (or (= (+ ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 1073741637) 0) (= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0)) .cse1 .cse18 .cse13 .cse12 .cse5 .cse16) (and .cse2 .cse13 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0) (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse1 (<= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) .cse13 (<= |ULTIMATE.start_FloppyPnp_#res| 0) .cse12 .cse5 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse1 .cse20 .cse21 .cse13 (not (= ~myStatus~0 259)) .cse22 .cse12 .cse5)))) [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point L494(lines 494 506) no Hoare annotation was computed. [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point L759(lines 759 763) no Hoare annotation was computed. [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point L363(lines 363 369) no Hoare annotation was computed. [2021-10-11 02:23:29,102 INFO L258 CegarLoopResult]: At program point L231(lines 230 423) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 2) ~SKIP1~0) (= ~pended~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~s~0 5) ~MPR3~0)) [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point L298-1(lines 232 420) no Hoare annotation was computed. [2021-10-11 02:23:29,102 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,103 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2021-10-11 02:23:29,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:29 BoogieIcfgContainer [2021-10-11 02:23:29,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:29,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:29,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:29,184 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:29,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:08" (3/4) ... [2021-10-11 02:23:29,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:23:29,217 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 217 nodes and edges [2021-10-11 02:23:29,221 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2021-10-11 02:23:29,225 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-11 02:23:29,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-11 02:23:29,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn == status) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || (((((NP + 5 <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0) && status + 1073741823 == 0)) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || (((pended == 0 && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && status <= 0) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) [2021-10-11 02:23:29,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn == status) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || (((((NP + 5 <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0) && status + 1073741823 == 0)) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || (((pended == 0 && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && status <= 0) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) [2021-10-11 02:23:29,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && status <= 0) && DC + 2 <= SKIP2) && ntStatus <= 0) && s == DC) && returnVal2 <= lowerDriverReturn) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(ntStatus == 259)) && !(259 == status)) && !(myStatus == 259)) && returnVal2 <= lowerDriverReturn) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(ntStatus == 259)) && !(259 == status)) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s)) || (((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && s == DC) && \result <= 258) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((s == DC && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || ((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) [2021-10-11 02:23:29,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 + 2 <= MPR1 && DC + 2 <= SKIP2) && DC + 2 <= s) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && status <= 0) && ntStatus <= 0) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && \result <= 0) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && ntStatus <= 0)) || (((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && DC + 2 <= SKIP2) && \result <= 258) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && \result <= 258) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0))) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((SKIP1 + 2 <= MPR1 && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && DC + 5 <= s)) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && !(259 == status)) && !(myStatus == 259)) && DC + 5 <= IPC) && !(259 == \result)) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result)))) || ((s == DC && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && !(259 == status)) && ntStatus == __cil_tmp30) && DC + 5 <= IPC) && !(259 == \result)) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) [2021-10-11 02:23:29,260 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11))) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((pended == 0 && s == DC) && status == 0) && \result + 1073741738 <= 0)) || (((((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) [2021-10-11 02:23:29,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((pended == 0 && compRegistered == 0) && s == NP) && status == 0) && NP + 4 <= MPR1) && !(259 == \result)) && s + 5 <= MPR3) || (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3) [2021-10-11 02:23:29,267 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) || (((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11))) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && ntStatus <= 0) && DC + 2 <= SKIP2) && s == DC) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == DC) && ntStatus == __cil_tmp30) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == DC) && !(myStatus == 259)) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) [2021-10-11 02:23:29,270 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && !(ntStatus == 259)) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && \result + 1073741670 <= 0) || (((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || (((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) [2021-10-11 02:23:29,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) [2021-10-11 02:23:29,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) [2021-10-11 02:23:29,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) [2021-10-11 02:23:29,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && s == DC) && !(ntStatus == 259)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) || ((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && \result <= 258) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) [2021-10-11 02:23:29,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) [2021-10-11 02:23:29,272 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && !(ntStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) [2021-10-11 02:23:29,418 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65801859-4a02-4601-b9ea-589428aa1086/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:29,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:29,419 INFO L168 Benchmark]: Toolchain (without parser) took 23895.44 ms. Allocated memory was 115.3 MB in the beginning and 406.8 MB in the end (delta: 291.5 MB). Free memory was 80.7 MB in the beginning and 352.9 MB in the end (delta: -272.3 MB). Peak memory consumption was 245.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,420 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 81.8 MB. Free memory was 54.8 MB in the beginning and 54.8 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:29,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.82 ms. Allocated memory is still 115.3 MB. Free memory was 80.3 MB in the beginning and 82.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 148.73 ms. Allocated memory is still 115.3 MB. Free memory was 82.1 MB in the beginning and 74.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,421 INFO L168 Benchmark]: Boogie Preprocessor took 79.55 ms. Allocated memory is still 115.3 MB. Free memory was 74.4 MB in the beginning and 69.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,421 INFO L168 Benchmark]: RCFGBuilder took 2688.83 ms. Allocated memory was 115.3 MB in the beginning and 169.9 MB in the end (delta: 54.5 MB). Free memory was 69.5 MB in the beginning and 102.8 MB in the end (delta: -33.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,422 INFO L168 Benchmark]: TraceAbstraction took 20212.35 ms. Allocated memory was 169.9 MB in the beginning and 406.8 MB in the end (delta: 237.0 MB). Free memory was 101.8 MB in the beginning and 147.4 MB in the end (delta: -45.6 MB). Peak memory consumption was 215.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,422 INFO L168 Benchmark]: Witness Printer took 234.75 ms. Allocated memory is still 406.8 MB. Free memory was 147.4 MB in the beginning and 352.9 MB in the end (delta: -205.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:29,424 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 81.8 MB. Free memory was 54.8 MB in the beginning and 54.8 MB in the end (delta: 25.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 524.82 ms. Allocated memory is still 115.3 MB. Free memory was 80.3 MB in the beginning and 82.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 148.73 ms. Allocated memory is still 115.3 MB. Free memory was 82.1 MB in the beginning and 74.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.55 ms. Allocated memory is still 115.3 MB. Free memory was 74.4 MB in the beginning and 69.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2688.83 ms. Allocated memory was 115.3 MB in the beginning and 169.9 MB in the end (delta: 54.5 MB). Free memory was 69.5 MB in the beginning and 102.8 MB in the end (delta: -33.4 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20212.35 ms. Allocated memory was 169.9 MB in the beginning and 406.8 MB in the end (delta: 237.0 MB). Free memory was 101.8 MB in the beginning and 147.4 MB in the end (delta: -45.6 MB). Peak memory consumption was 215.5 MB. Max. memory is 16.1 GB. * Witness Printer took 234.75 ms. Allocated memory is still 406.8 MB. Free memory was 147.4 MB in the beginning and 352.9 MB in the end (delta: -205.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 65]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && (MPR3 == s || s == NP)) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && (MPR3 == s || s == NP)) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((NP + 5 <= MPR3 && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((pended == 0 && compRegistered == 0) && s == NP) && status == 0) && NP + 4 <= MPR1) && !(259 == \result)) && s + 5 <= MPR3) || (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && compRegistered == 0) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && DC + 5 <= s) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && compRegistered == 0) && DC + 2 <= s) && SKIP2 == s) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && !(ntStatus == 259)) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && \result + 1073741670 <= 0) || (((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || (((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == NP) && status == 0) && myStatus == 0) && SKIP2 + 3 <= IPC) && compRegistered == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && myStatus == 0) && SKIP2 + 3 <= IPC - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || (((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && !(ntStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && s == DC) && !(ntStatus == 259)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) || ((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && \result <= 258) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && (260 <= ntStatus || ntStatus <= 258)) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && ntStatus <= 0) && DC + 2 <= SKIP2) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && compRegistered == 1) && s + 5 <= MPR3 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: (((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1 - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn == status) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || (((((NP + 5 <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0) && status + 1073741823 == 0)) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || (((pended == 0 && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && status <= 0) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && compRegistered == 0) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((NP + 5 <= MPR3 && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && compRegistered == 0) && !(myStatus == 259)) && s == NP) && status == 0) && SKIP2 + 3 <= IPC - InvariantResult [Line: 758]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && status <= 0) && DC + 2 <= SKIP2) && ntStatus <= 0) && s == DC) && returnVal2 <= lowerDriverReturn) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(ntStatus == 259)) && !(259 == status)) && !(myStatus == 259)) && returnVal2 <= lowerDriverReturn) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(ntStatus == 259)) && !(259 == status)) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s)) || (((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && s == DC) && \result <= 258) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((s == DC && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || ((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) - InvariantResult [Line: 1009]: Loop Invariant Derived loop invariant: ((pended == 0 && compRegistered == 0) && status == 0) && DC == s - InvariantResult [Line: 704]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn == status) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || (((((NP + 5 <= MPR3 && s == DC) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0) && status + 1073741823 == 0)) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || (((pended == 0 && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && status <= 0) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == status)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) - InvariantResult [Line: 710]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && myStatus == 0) && lowerDriverReturn == status) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && ntStatus <= 0) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && compRegistered == 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) || (((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || ((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11))) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && ntStatus <= 0) && DC + 2 <= SKIP2) && s == DC) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == DC) && ntStatus == __cil_tmp30) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == DC) && !(myStatus == 259)) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 944]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && ntStatus <= 0) && compRegistered == 0) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && !(ntStatus == 259)) && (s == NP || (returnVal2 <= 259 && 259 <= returnVal2))) && myStatus == 0) && (MPR3 == s || s == NP)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 750]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && DC + 2 <= SKIP2) && setEventCalled == 1) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && ntStatus <= 0) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC) && compRegistered == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && compRegistered == 0) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: ((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && ntStatus == __cil_tmp30) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && myStatus == 0) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && s == NP) && status == 0) && myStatus == 0) && SKIP2 + 3 <= IPC) && compRegistered == 1 - InvariantResult [Line: 727]: Loop Invariant Derived loop invariant: ((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && compRegistered == 0) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && !(ntStatus == 259)) && myStatus == 0) && SKIP2 + 3 <= IPC - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && DC + 2 <= SKIP2) && DC + 2 <= s) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && status <= 0) && ntStatus <= 0) && DC + 2 <= SKIP2) && DC + 5 <= IPC) && \result <= 0) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && ntStatus <= 0)) || (((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && ntStatus <= 258) && DC + 2 <= SKIP2) && \result <= 258) && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && \result <= 258) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && status <= 258) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0))) || ((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= status || status <= 258))) || ((((SKIP1 + 2 <= MPR1 && DC + 5 <= IPC) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) && DC + 5 <= s)) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && !(259 == status)) && !(myStatus == 259)) && DC + 5 <= IPC) && !(259 == \result)) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result)))) || ((s == DC && status + 1073741738 <= 0) && \result + 1073741738 <= 0)) || (((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && DC + 2 <= SKIP2) && !(ntStatus == 259)) && !(259 == status)) && ntStatus == __cil_tmp30) && DC + 5 <= IPC) && !(259 == \result)) && SKIP2 + 3 <= IPC) && ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && s == DC) && NP + 4 <= MPR1) || ((((NP + 5 <= MPR3 && lowerDriverReturn == returnVal2) && lowerDriverReturn == status) && NP + 4 <= MPR1) && lowerDriverReturn == \result))) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && compRegistered == 0) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((NP + 5 <= MPR3 && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: ((((((((((((((((((((260 <= ntStatus || ntStatus <= 258) && NP + 2 <= SKIP1) && SKIP1 + 2 <= MPR1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && (\result <= 258 || 260 <= \result)) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) || ((((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && ntStatus <= 258) && s + 5 <= MPR3) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && ntStatus <= 0) && \result <= 258) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC)) || ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && lowerDriverReturn == returnVal2) && s == NP) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && s + 5 <= MPR3) && ntStatus <= 0) && !(myStatus == 259)) && SKIP2 + 3 <= IPC) && ntStatus + 1 <= 0) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && s == DC) && !(myStatus == 259)) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) || (((((((((((((((((260 <= ntStatus || ntStatus <= 258) && SKIP1 + 2 <= MPR1) && NP + 2 <= SKIP1) && (__cil_tmp11 <= 259 || __cil_tmp11 <= ntStatus)) && pended == 0) && DC + 2 <= SKIP2) && (260 <= \result || \result <= 258)) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (\result <= 258 || 260 <= \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11))) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && IPC == s) && lowerDriverReturn == returnVal2) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) && DC + 5 <= s)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && s == DC) && !(259 == \result)) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC)) || (((pended == 0 && s == DC) && status == 0) && \result + 1073741738 <= 0)) || (((((NP + 5 <= MPR3 && s == DC) && status == 0) && ntStatus + 1073741823 == 0) && NP + 4 <= MPR1) && \result + 1073741823 == 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && ntStatus <= 258) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && ntStatus <= 258) && (ntStatus + 1073741637 == 0 || ntStatus == 0)) && NP + 5 <= MPR3) && \result <= 258) && s == DC) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && \result <= 258)) || ((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && lowerDriverReturn == \result)) || ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && status == 0) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && ntStatus <= 0) && s == DC) && \result <= 0) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC) && ntStatus <= 0)) || (((((((((SKIP1 + 2 <= MPR1 && NP + 5 <= MPR3) && pended == 0) && lowerDriverReturn == returnVal2) && DC + 2 <= s) && SKIP2 == s) && status == 0) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && lowerDriverReturn == \result) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP2 + 3 <= IPC) && s + 5 <= MPR3 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && pended == 0) && DC + 2 <= SKIP2) && setEventCalled == 1) && status == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && MPR1 == s) && ntStatus <= 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && SKIP2 + 3 <= IPC - InvariantResult [Line: 670]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && pended == 0) && DC + 2 <= SKIP2) && ntStatus == __cil_tmp30) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && NP + 5 <= MPR3) && ntStatus == lowerDriverReturn) && myStatus == 0) && SKIP2 + 3 <= IPC) && lowerDriverReturn <= returnVal2 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1) && NP + 5 <= MPR3) && pended == 0) && compRegistered == 0) && DC + 2 <= s) && status == 0) && SKIP2 == s) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 + 3 <= IPC - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((NP + 5 <= MPR3 && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((NP + 5 <= MPR3 && pended == 0) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && NP + 2 <= s) && SKIP2 + 3 <= IPC - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 40 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.9s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6763 SDtfs, 5664 SDslu, 6947 SDs, 0 SdLazy, 2841 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 527 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 82 PreInvPairs, 244 NumberOfFragments, 7583 HoareAnnotationTreeSize, 82 FomulaSimplifications, 135502 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 82 FomulaSimplificationsInter, 90536 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 79677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...