./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.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_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/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_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/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_125196bd-8496-46dc-b96a-b774107b772d/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 3dcfb71b16f6783353008d1be8597dab2a9bd20e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:54,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:22:54,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:22:54,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:22:54,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:22:54,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:22:54,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:22:54,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:22:54,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:22:54,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:22:54,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:22:54,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:22:54,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:22:54,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:22:54,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:22:54,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:22:54,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:22:54,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:22:54,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:22:54,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:22:54,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:22:54,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:22:54,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:22:54,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:22:54,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:22:54,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:22:54,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:22:54,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:22:54,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:22:54,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:22:54,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:22:54,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:22:54,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:22:54,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:22:54,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:22:54,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:22:54,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:22:54,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:22:54,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:22:54,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:22:54,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:22:54,315 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:22:54,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:22:54,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:22:54,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:22:54,370 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:22:54,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:22:54,371 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:22:54,371 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:22:54,371 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:22:54,375 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:22:54,375 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:22:54,376 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:22:54,377 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:22:54,377 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:22:54,377 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:22:54,377 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:22:54,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:22:54,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:22:54,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:22:54,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:22:54,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:22:54,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:22:54,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:22:54,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:22:54,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:22:54,380 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:22:54,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:22:54,381 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:22:54,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:22:54,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:22:54,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:22:54,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:22:54,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:22:54,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:22:54,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:22:54,385 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:22:54,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:22:54,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:22:54,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:22:54,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:22:54,387 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_125196bd-8496-46dc-b96a-b774107b772d/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_125196bd-8496-46dc-b96a-b774107b772d/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 -> 3dcfb71b16f6783353008d1be8597dab2a9bd20e [2021-10-11 02:22:54,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:22:54,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:22:54,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:22:54,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:22:54,698 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:22:54,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-11 02:22:54,787 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/data/0210c3abb/b27db58b1fbe48e1b2eb0985314163c3/FLAG44768229b [2021-10-11 02:22:55,466 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:22:55,467 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-11 02:22:55,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/data/0210c3abb/b27db58b1fbe48e1b2eb0985314163c3/FLAG44768229b [2021-10-11 02:22:55,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/data/0210c3abb/b27db58b1fbe48e1b2eb0985314163c3 [2021-10-11 02:22:55,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:22:55,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:22:55,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:55,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:22:55,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:22:55,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:55" (1/1) ... [2021-10-11 02:22:55,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ac56e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:55, skipping insertion in model container [2021-10-11 02:22:55,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:22:55" (1/1) ... [2021-10-11 02:22:55,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:22:55,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:22:56,183 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_125196bd-8496-46dc-b96a-b774107b772d/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-11 02:22:56,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:56,205 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:22:56,338 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_125196bd-8496-46dc-b96a-b774107b772d/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-11 02:22:56,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:22:56,363 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:22:56,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56 WrapperNode [2021-10-11 02:22:56,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:22:56,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:56,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:22:56,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:22:56,374 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:22:56" (1/1) ... [2021-10-11 02:22:56,403 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:22:56" (1/1) ... [2021-10-11 02:22:56,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:22:56,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:22:56,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:22:56,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:22:56,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... [2021-10-11 02:22:56,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:22:56,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:22:56,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:22:56,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:22:56,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/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:22:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:22:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:22:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:22:56,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:22:57,179 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,191 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,195 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,201 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,202 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,203 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,207 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,212 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,215 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,218 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,219 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,221 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,224 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,227 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,228 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,229 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,232 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,234 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,236 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,236 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,239 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,241 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,244 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,247 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,249 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,252 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,255 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,256 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,257 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:57,259 WARN L800 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-11 02:22:58,455 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-11 02:22:58,456 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-11 02:22:58,456 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-11 02:22:58,456 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-11 02:22:58,456 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-11 02:22:58,456 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-11 02:22:58,457 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-11 02:22:58,457 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-11 02:22:58,457 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-11 02:22:58,457 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-11 02:22:58,458 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-11 02:22:58,459 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-11 02:22:58,459 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-11 02:22:58,459 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-11 02:22:58,459 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-11 02:22:58,460 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-11 02:22:58,461 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-11 02:22:58,462 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-11 02:22:58,462 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-11 02:22:58,462 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-11 02:22:58,462 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-11 02:22:58,462 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-11 02:22:58,463 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-11 02:22:58,464 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-11 02:22:58,464 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-11 02:22:58,464 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-11 02:22:58,464 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-11 02:22:58,464 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-11 02:22:58,465 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-11 02:22:58,466 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-11 02:22:58,466 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-11 02:22:58,466 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-11 02:22:58,466 INFO L752 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-11 02:22:59,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:22:59,848 INFO L299 CfgBuilder]: Removed 275 assume(true) statements. [2021-10-11 02:22:59,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:59 BoogieIcfgContainer [2021-10-11 02:22:59,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:22:59,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:22:59,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:22:59,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:22:59,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:22:55" (1/3) ... [2021-10-11 02:22:59,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae56741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:59, skipping insertion in model container [2021-10-11 02:22:59,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:22:56" (2/3) ... [2021-10-11 02:22:59,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae56741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:22:59, skipping insertion in model container [2021-10-11 02:22:59,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:59" (3/3) ... [2021-10-11 02:22:59,864 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-11 02:22:59,880 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:22:59,885 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2021-10-11 02:22:59,903 INFO L253 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2021-10-11 02:22:59,953 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:22:59,954 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:22:59,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:22:59,958 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:22:59,958 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:22:59,958 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:22:59,959 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:22:59,959 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2021-10-11 02:23:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:23:00,008 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:00,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:23:00,010 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -602899791, now seen corresponding path program 1 times [2021-10-11 02:23:00,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:00,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312043247] [2021-10-11 02:23:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:00,322 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:00,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312043247] [2021-10-11 02:23:00,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:00,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:00,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491094967] [2021-10-11 02:23:00,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:00,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:00,346 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2021-10-11 02:23:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:00,768 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2021-10-11 02:23:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:00,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-10-11 02:23:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:00,799 INFO L225 Difference]: With dead ends: 637 [2021-10-11 02:23:00,800 INFO L226 Difference]: Without dead ends: 359 [2021-10-11 02:23:00,811 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:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-10-11 02:23:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2021-10-11 02:23:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-10-11 02:23:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2021-10-11 02:23:00,870 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2021-10-11 02:23:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:00,870 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2021-10-11 02:23:00,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2021-10-11 02:23:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:23:00,872 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:00,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:00,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:00,873 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1955754279, now seen corresponding path program 1 times [2021-10-11 02:23:00,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:00,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398155741] [2021-10-11 02:23:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:00,938 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:00,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398155741] [2021-10-11 02:23:00,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:00,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:00,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254473616] [2021-10-11 02:23:00,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:00,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:00,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:00,945 INFO L87 Difference]: Start difference. First operand 342 states and 464 transitions. Second operand 3 states. [2021-10-11 02:23:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:00,987 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2021-10-11 02:23:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:00,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-10-11 02:23:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:00,991 INFO L225 Difference]: With dead ends: 378 [2021-10-11 02:23:00,992 INFO L226 Difference]: Without dead ends: 358 [2021-10-11 02:23:00,993 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:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-11 02:23:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2021-10-11 02:23:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2021-10-11 02:23:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 479 transitions. [2021-10-11 02:23:01,026 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 479 transitions. Word has length 10 [2021-10-11 02:23:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,027 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 479 transitions. [2021-10-11 02:23:01,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 479 transitions. [2021-10-11 02:23:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:23:01,028 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:01,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:23:01,029 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1592297028, now seen corresponding path program 1 times [2021-10-11 02:23:01,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717896929] [2021-10-11 02:23:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,171 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:01,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717896929] [2021-10-11 02:23:01,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:01,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585018335] [2021-10-11 02:23:01,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:01,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:01,178 INFO L87 Difference]: Start difference. First operand 353 states and 479 transitions. Second operand 3 states. [2021-10-11 02:23:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:01,225 INFO L93 Difference]: Finished difference Result 431 states and 575 transitions. [2021-10-11 02:23:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:01,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-10-11 02:23:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:01,228 INFO L225 Difference]: With dead ends: 431 [2021-10-11 02:23:01,229 INFO L226 Difference]: Without dead ends: 397 [2021-10-11 02:23:01,230 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:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-11 02:23:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 373. [2021-10-11 02:23:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2021-10-11 02:23:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 509 transitions. [2021-10-11 02:23:01,289 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 509 transitions. Word has length 11 [2021-10-11 02:23:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,290 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 509 transitions. [2021-10-11 02:23:01,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 509 transitions. [2021-10-11 02:23:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:23:01,292 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:01,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:23:01,293 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -560634284, now seen corresponding path program 1 times [2021-10-11 02:23:01,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698487165] [2021-10-11 02:23:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,409 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:01,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698487165] [2021-10-11 02:23:01,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:01,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975266763] [2021-10-11 02:23:01,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:01,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:01,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:01,416 INFO L87 Difference]: Start difference. First operand 373 states and 509 transitions. Second operand 3 states. [2021-10-11 02:23:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:01,513 INFO L93 Difference]: Finished difference Result 611 states and 816 transitions. [2021-10-11 02:23:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:01,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-10-11 02:23:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:01,517 INFO L225 Difference]: With dead ends: 611 [2021-10-11 02:23:01,517 INFO L226 Difference]: Without dead ends: 435 [2021-10-11 02:23:01,522 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:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-10-11 02:23:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 351. [2021-10-11 02:23:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2021-10-11 02:23:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2021-10-11 02:23:01,544 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 12 [2021-10-11 02:23:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,544 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2021-10-11 02:23:01,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2021-10-11 02:23:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:23:01,550 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:01,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:23:01,552 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1003060262, now seen corresponding path program 1 times [2021-10-11 02:23:01,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973769370] [2021-10-11 02:23:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,617 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:01,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973769370] [2021-10-11 02:23:01,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:01,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227343115] [2021-10-11 02:23:01,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:01,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:01,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:01,621 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand 3 states. [2021-10-11 02:23:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:01,855 INFO L93 Difference]: Finished difference Result 375 states and 503 transitions. [2021-10-11 02:23:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:01,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2021-10-11 02:23:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:01,858 INFO L225 Difference]: With dead ends: 375 [2021-10-11 02:23:01,858 INFO L226 Difference]: Without dead ends: 357 [2021-10-11 02:23:01,860 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:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-10-11 02:23:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-10-11 02:23:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2021-10-11 02:23:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2021-10-11 02:23:01,881 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 14 [2021-10-11 02:23:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:01,881 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2021-10-11 02:23:01,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2021-10-11 02:23:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:23:01,885 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:01,885 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:01,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:23:01,886 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 170610062, now seen corresponding path program 1 times [2021-10-11 02:23:01,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:01,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510194543] [2021-10-11 02:23:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:01,941 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:01,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510194543] [2021-10-11 02:23:01,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:01,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:01,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852322080] [2021-10-11 02:23:01,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:01,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:01,944 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand 3 states. [2021-10-11 02:23:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,169 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2021-10-11 02:23:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-10-11 02:23:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,172 INFO L225 Difference]: With dead ends: 357 [2021-10-11 02:23:02,173 INFO L226 Difference]: Without dead ends: 341 [2021-10-11 02:23:02,173 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:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-11 02:23:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-10-11 02:23:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2021-10-11 02:23:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2021-10-11 02:23:02,192 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2021-10-11 02:23:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,192 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2021-10-11 02:23:02,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2021-10-11 02:23:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 02:23:02,193 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,193 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:02,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:23:02,194 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1537883692, now seen corresponding path program 1 times [2021-10-11 02:23:02,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859086763] [2021-10-11 02:23:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,243 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:02,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859086763] [2021-10-11 02:23:02,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:02,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882583518] [2021-10-11 02:23:02,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:02,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,246 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand 4 states. [2021-10-11 02:23:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,321 INFO L93 Difference]: Finished difference Result 446 states and 583 transitions. [2021-10-11 02:23:02,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:02,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2021-10-11 02:23:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,325 INFO L225 Difference]: With dead ends: 446 [2021-10-11 02:23:02,325 INFO L226 Difference]: Without dead ends: 410 [2021-10-11 02:23:02,326 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:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-10-11 02:23:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 343. [2021-10-11 02:23:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2021-10-11 02:23:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 465 transitions. [2021-10-11 02:23:02,350 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 465 transitions. Word has length 19 [2021-10-11 02:23:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,350 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 465 transitions. [2021-10-11 02:23:02,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 465 transitions. [2021-10-11 02:23:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:23:02,352 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,352 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:02,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:23:02,353 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1603686774, now seen corresponding path program 1 times [2021-10-11 02:23:02,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10492938] [2021-10-11 02:23:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,451 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:02,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10492938] [2021-10-11 02:23:02,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:02,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609000170] [2021-10-11 02:23:02,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:02,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:02,453 INFO L87 Difference]: Start difference. First operand 343 states and 465 transitions. Second operand 3 states. [2021-10-11 02:23:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:02,656 INFO L93 Difference]: Finished difference Result 443 states and 598 transitions. [2021-10-11 02:23:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:02,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-10-11 02:23:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:02,659 INFO L225 Difference]: With dead ends: 443 [2021-10-11 02:23:02,659 INFO L226 Difference]: Without dead ends: 340 [2021-10-11 02:23:02,660 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:02,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-11 02:23:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-10-11 02:23:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2021-10-11 02:23:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 461 transitions. [2021-10-11 02:23:02,682 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 461 transitions. Word has length 20 [2021-10-11 02:23:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:02,682 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 461 transitions. [2021-10-11 02:23:02,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 461 transitions. [2021-10-11 02:23:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:23:02,684 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:02,684 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:02,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:23:02,684 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash -522878808, now seen corresponding path program 1 times [2021-10-11 02:23:02,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:02,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98285006] [2021-10-11 02:23:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:02,772 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:02,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98285006] [2021-10-11 02:23:02,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:02,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:02,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050259125] [2021-10-11 02:23:02,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:02,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:02,781 INFO L87 Difference]: Start difference. First operand 340 states and 461 transitions. Second operand 4 states. [2021-10-11 02:23:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,024 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2021-10-11 02:23:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:03,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-10-11 02:23:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,028 INFO L225 Difference]: With dead ends: 345 [2021-10-11 02:23:03,030 INFO L226 Difference]: Without dead ends: 340 [2021-10-11 02:23:03,030 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:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-11 02:23:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-10-11 02:23:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2021-10-11 02:23:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 460 transitions. [2021-10-11 02:23:03,054 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 460 transitions. Word has length 20 [2021-10-11 02:23:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,055 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 460 transitions. [2021-10-11 02:23:03,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 460 transitions. [2021-10-11 02:23:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:23:03,056 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,056 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:03,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:23:03,057 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 66037917, now seen corresponding path program 1 times [2021-10-11 02:23:03,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9706186] [2021-10-11 02:23:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,108 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:03,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9706186] [2021-10-11 02:23:03,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410028466] [2021-10-11 02:23:03,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:03,110 INFO L87 Difference]: Start difference. First operand 340 states and 460 transitions. Second operand 3 states. [2021-10-11 02:23:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,341 INFO L93 Difference]: Finished difference Result 420 states and 561 transitions. [2021-10-11 02:23:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 02:23:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,345 INFO L225 Difference]: With dead ends: 420 [2021-10-11 02:23:03,345 INFO L226 Difference]: Without dead ends: 412 [2021-10-11 02:23:03,346 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:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-11 02:23:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 352. [2021-10-11 02:23:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2021-10-11 02:23:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 478 transitions. [2021-10-11 02:23:03,380 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 478 transitions. Word has length 21 [2021-10-11 02:23:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,382 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 478 transitions. [2021-10-11 02:23:03,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 478 transitions. [2021-10-11 02:23:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:23:03,383 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,384 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:03,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:23:03,384 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 441358373, now seen corresponding path program 1 times [2021-10-11 02:23:03,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796231841] [2021-10-11 02:23:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,456 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:03,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796231841] [2021-10-11 02:23:03,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:03,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124217739] [2021-10-11 02:23:03,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:03,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:03,460 INFO L87 Difference]: Start difference. First operand 352 states and 478 transitions. Second operand 4 states. [2021-10-11 02:23:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,740 INFO L93 Difference]: Finished difference Result 357 states and 482 transitions. [2021-10-11 02:23:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:03,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2021-10-11 02:23:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,747 INFO L225 Difference]: With dead ends: 357 [2021-10-11 02:23:03,747 INFO L226 Difference]: Without dead ends: 352 [2021-10-11 02:23:03,748 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:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-11 02:23:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2021-10-11 02:23:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2021-10-11 02:23:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2021-10-11 02:23:03,778 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 21 [2021-10-11 02:23:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,780 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2021-10-11 02:23:03,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2021-10-11 02:23:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:23:03,782 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,782 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:03,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:23:03,783 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash 623638162, now seen corresponding path program 1 times [2021-10-11 02:23:03,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032935491] [2021-10-11 02:23:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:03,834 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:03,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032935491] [2021-10-11 02:23:03,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:03,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:03,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433517350] [2021-10-11 02:23:03,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:03,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:03,837 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand 3 states. [2021-10-11 02:23:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:03,891 INFO L93 Difference]: Finished difference Result 394 states and 523 transitions. [2021-10-11 02:23:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:03,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-10-11 02:23:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:03,894 INFO L225 Difference]: With dead ends: 394 [2021-10-11 02:23:03,895 INFO L226 Difference]: Without dead ends: 340 [2021-10-11 02:23:03,896 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:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-11 02:23:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2021-10-11 02:23:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2021-10-11 02:23:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 452 transitions. [2021-10-11 02:23:03,928 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 452 transitions. Word has length 21 [2021-10-11 02:23:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:03,928 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 452 transitions. [2021-10-11 02:23:03,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 452 transitions. [2021-10-11 02:23:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:03,930 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:03,930 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:03,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:23:03,930 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2039517494, now seen corresponding path program 1 times [2021-10-11 02:23:03,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:03,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263537188] [2021-10-11 02:23:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,008 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:04,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263537188] [2021-10-11 02:23:04,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:04,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73134529] [2021-10-11 02:23:04,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:04,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:04,010 INFO L87 Difference]: Start difference. First operand 336 states and 452 transitions. Second operand 4 states. [2021-10-11 02:23:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,291 INFO L93 Difference]: Finished difference Result 406 states and 528 transitions. [2021-10-11 02:23:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:04,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-10-11 02:23:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,294 INFO L225 Difference]: With dead ends: 406 [2021-10-11 02:23:04,294 INFO L226 Difference]: Without dead ends: 348 [2021-10-11 02:23:04,295 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:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-10-11 02:23:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 328. [2021-10-11 02:23:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2021-10-11 02:23:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 437 transitions. [2021-10-11 02:23:04,318 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 437 transitions. Word has length 22 [2021-10-11 02:23:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,319 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 437 transitions. [2021-10-11 02:23:04,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 437 transitions. [2021-10-11 02:23:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:04,320 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,320 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:04,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:23:04,321 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1598502227, now seen corresponding path program 1 times [2021-10-11 02:23:04,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524113448] [2021-10-11 02:23:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,350 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:04,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524113448] [2021-10-11 02:23:04,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:04,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997179595] [2021-10-11 02:23:04,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:04,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:04,352 INFO L87 Difference]: Start difference. First operand 328 states and 437 transitions. Second operand 3 states. [2021-10-11 02:23:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,400 INFO L93 Difference]: Finished difference Result 425 states and 553 transitions. [2021-10-11 02:23:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:04,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-10-11 02:23:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,402 INFO L225 Difference]: With dead ends: 425 [2021-10-11 02:23:04,402 INFO L226 Difference]: Without dead ends: 324 [2021-10-11 02:23:04,403 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:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-11 02:23:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 310. [2021-10-11 02:23:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2021-10-11 02:23:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 407 transitions. [2021-10-11 02:23:04,425 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 407 transitions. Word has length 22 [2021-10-11 02:23:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,425 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 407 transitions. [2021-10-11 02:23:04,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 407 transitions. [2021-10-11 02:23:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:04,426 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,426 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:04,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:23:04,427 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash 436944255, now seen corresponding path program 1 times [2021-10-11 02:23:04,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438159764] [2021-10-11 02:23:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,457 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:04,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438159764] [2021-10-11 02:23:04,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:04,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391911801] [2021-10-11 02:23:04,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:04,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:04,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:04,459 INFO L87 Difference]: Start difference. First operand 310 states and 407 transitions. Second operand 4 states. [2021-10-11 02:23:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,526 INFO L93 Difference]: Finished difference Result 323 states and 419 transitions. [2021-10-11 02:23:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:04,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-10-11 02:23:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,529 INFO L225 Difference]: With dead ends: 323 [2021-10-11 02:23:04,529 INFO L226 Difference]: Without dead ends: 308 [2021-10-11 02:23:04,531 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:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-11 02:23:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-10-11 02:23:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-10-11 02:23:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 404 transitions. [2021-10-11 02:23:04,553 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 404 transitions. Word has length 22 [2021-10-11 02:23:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 404 transitions. [2021-10-11 02:23:04,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 404 transitions. [2021-10-11 02:23:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:04,555 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,555 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:04,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:23:04,556 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1538494892, now seen corresponding path program 1 times [2021-10-11 02:23:04,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118094907] [2021-10-11 02:23:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,604 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:04,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118094907] [2021-10-11 02:23:04,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:04,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645517318] [2021-10-11 02:23:04,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:04,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:04,609 INFO L87 Difference]: Start difference. First operand 308 states and 404 transitions. Second operand 4 states. [2021-10-11 02:23:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,674 INFO L93 Difference]: Finished difference Result 346 states and 443 transitions. [2021-10-11 02:23:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:04,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-10-11 02:23:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,677 INFO L225 Difference]: With dead ends: 346 [2021-10-11 02:23:04,677 INFO L226 Difference]: Without dead ends: 325 [2021-10-11 02:23:04,677 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:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-10-11 02:23:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 310. [2021-10-11 02:23:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2021-10-11 02:23:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 406 transitions. [2021-10-11 02:23:04,699 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 406 transitions. Word has length 22 [2021-10-11 02:23:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,699 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 406 transitions. [2021-10-11 02:23:04,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 406 transitions. [2021-10-11 02:23:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:23:04,700 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,700 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:04,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:23:04,701 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1983467021, now seen corresponding path program 1 times [2021-10-11 02:23:04,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656197645] [2021-10-11 02:23:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,740 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:04,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656197645] [2021-10-11 02:23:04,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:04,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199167233] [2021-10-11 02:23:04,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:04,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:04,743 INFO L87 Difference]: Start difference. First operand 310 states and 406 transitions. Second operand 4 states. [2021-10-11 02:23:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,801 INFO L93 Difference]: Finished difference Result 323 states and 418 transitions. [2021-10-11 02:23:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:04,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-10-11 02:23:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,804 INFO L225 Difference]: With dead ends: 323 [2021-10-11 02:23:04,804 INFO L226 Difference]: Without dead ends: 308 [2021-10-11 02:23:04,805 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:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-11 02:23:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2021-10-11 02:23:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-10-11 02:23:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 403 transitions. [2021-10-11 02:23:04,825 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 403 transitions. Word has length 22 [2021-10-11 02:23:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,826 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 403 transitions. [2021-10-11 02:23:04,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 403 transitions. [2021-10-11 02:23:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:23:04,827 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,827 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:04,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:23:04,827 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash -122455389, now seen corresponding path program 1 times [2021-10-11 02:23:04,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721277345] [2021-10-11 02:23:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:04,864 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:04,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721277345] [2021-10-11 02:23:04,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:04,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:04,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697805864] [2021-10-11 02:23:04,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:04,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:04,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:04,871 INFO L87 Difference]: Start difference. First operand 308 states and 403 transitions. Second operand 3 states. [2021-10-11 02:23:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:04,912 INFO L93 Difference]: Finished difference Result 425 states and 545 transitions. [2021-10-11 02:23:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:04,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 02:23:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:04,915 INFO L225 Difference]: With dead ends: 425 [2021-10-11 02:23:04,915 INFO L226 Difference]: Without dead ends: 331 [2021-10-11 02:23:04,917 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:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-11 02:23:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 296. [2021-10-11 02:23:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2021-10-11 02:23:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 385 transitions. [2021-10-11 02:23:04,938 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 385 transitions. Word has length 23 [2021-10-11 02:23:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:04,939 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 385 transitions. [2021-10-11 02:23:04,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 385 transitions. [2021-10-11 02:23:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:04,940 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:04,940 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:04,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:23:04,940 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1050500700, now seen corresponding path program 1 times [2021-10-11 02:23:04,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:04,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141241530] [2021-10-11 02:23:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,083 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:05,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141241530] [2021-10-11 02:23:05,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:05,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:05,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750127605] [2021-10-11 02:23:05,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:05,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:05,086 INFO L87 Difference]: Start difference. First operand 296 states and 385 transitions. Second operand 3 states. [2021-10-11 02:23:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,146 INFO L93 Difference]: Finished difference Result 396 states and 507 transitions. [2021-10-11 02:23:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:05,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 02:23:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,148 INFO L225 Difference]: With dead ends: 396 [2021-10-11 02:23:05,148 INFO L226 Difference]: Without dead ends: 298 [2021-10-11 02:23:05,149 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:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-11 02:23:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 284. [2021-10-11 02:23:05,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2021-10-11 02:23:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 367 transitions. [2021-10-11 02:23:05,171 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 367 transitions. Word has length 24 [2021-10-11 02:23:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,171 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 367 transitions. [2021-10-11 02:23:05,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 367 transitions. [2021-10-11 02:23:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:05,172 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,173 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:05,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:23:05,173 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,174 INFO L82 PathProgramCache]: Analyzing trace with hash -867629886, now seen corresponding path program 1 times [2021-10-11 02:23:05,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571032675] [2021-10-11 02:23:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,243 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:05,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571032675] [2021-10-11 02:23:05,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:05,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:05,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347620300] [2021-10-11 02:23:05,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:05,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:05,245 INFO L87 Difference]: Start difference. First operand 284 states and 367 transitions. Second operand 4 states. [2021-10-11 02:23:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,510 INFO L93 Difference]: Finished difference Result 328 states and 411 transitions. [2021-10-11 02:23:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:05,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-10-11 02:23:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,514 INFO L225 Difference]: With dead ends: 328 [2021-10-11 02:23:05,514 INFO L226 Difference]: Without dead ends: 286 [2021-10-11 02:23:05,515 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:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-11 02:23:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2021-10-11 02:23:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2021-10-11 02:23:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 358 transitions. [2021-10-11 02:23:05,544 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 358 transitions. Word has length 24 [2021-10-11 02:23:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,545 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 358 transitions. [2021-10-11 02:23:05,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 358 transitions. [2021-10-11 02:23:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:23:05,546 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,547 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:05,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 02:23:05,554 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,555 INFO L82 PathProgramCache]: Analyzing trace with hash 769111241, now seen corresponding path program 1 times [2021-10-11 02:23:05,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242181043] [2021-10-11 02:23:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,624 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:05,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242181043] [2021-10-11 02:23:05,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:05,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:05,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619766412] [2021-10-11 02:23:05,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:05,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:05,626 INFO L87 Difference]: Start difference. First operand 284 states and 358 transitions. Second operand 5 states. [2021-10-11 02:23:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:05,701 INFO L93 Difference]: Finished difference Result 297 states and 370 transitions. [2021-10-11 02:23:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:05,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2021-10-11 02:23:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:05,704 INFO L225 Difference]: With dead ends: 297 [2021-10-11 02:23:05,704 INFO L226 Difference]: Without dead ends: 280 [2021-10-11 02:23:05,705 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:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-10-11 02:23:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2021-10-11 02:23:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-10-11 02:23:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 353 transitions. [2021-10-11 02:23:05,731 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 353 transitions. Word has length 24 [2021-10-11 02:23:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:05,733 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 353 transitions. [2021-10-11 02:23:05,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 353 transitions. [2021-10-11 02:23:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:05,734 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:05,734 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:05,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 02:23:05,735 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1663762804, now seen corresponding path program 1 times [2021-10-11 02:23:05,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:05,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813447930] [2021-10-11 02:23:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:05,795 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:05,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813447930] [2021-10-11 02:23:05,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:05,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:05,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008440202] [2021-10-11 02:23:05,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:05,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:05,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:05,797 INFO L87 Difference]: Start difference. First operand 280 states and 353 transitions. Second operand 4 states. [2021-10-11 02:23:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:06,114 INFO L93 Difference]: Finished difference Result 368 states and 461 transitions. [2021-10-11 02:23:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:06,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-10-11 02:23:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:06,117 INFO L225 Difference]: With dead ends: 368 [2021-10-11 02:23:06,117 INFO L226 Difference]: Without dead ends: 282 [2021-10-11 02:23:06,119 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:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-11 02:23:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2021-10-11 02:23:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-10-11 02:23:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 350 transitions. [2021-10-11 02:23:06,148 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 350 transitions. Word has length 25 [2021-10-11 02:23:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:06,148 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 350 transitions. [2021-10-11 02:23:06,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 350 transitions. [2021-10-11 02:23:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:23:06,149 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:06,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] [2021-10-11 02:23:06,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 02:23:06,150 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1025389077, now seen corresponding path program 1 times [2021-10-11 02:23:06,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814626032] [2021-10-11 02:23:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,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:06,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814626032] [2021-10-11 02:23:06,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:06,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:06,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014310120] [2021-10-11 02:23:06,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:06,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:06,206 INFO L87 Difference]: Start difference. First operand 280 states and 350 transitions. Second operand 4 states. [2021-10-11 02:23:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:06,440 INFO L93 Difference]: Finished difference Result 322 states and 393 transitions. [2021-10-11 02:23:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:06,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-10-11 02:23:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:06,444 INFO L225 Difference]: With dead ends: 322 [2021-10-11 02:23:06,444 INFO L226 Difference]: Without dead ends: 280 [2021-10-11 02:23:06,445 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:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-10-11 02:23:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2021-10-11 02:23:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-10-11 02:23:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 341 transitions. [2021-10-11 02:23:06,502 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 341 transitions. Word has length 25 [2021-10-11 02:23:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:06,503 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 341 transitions. [2021-10-11 02:23:06,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 341 transitions. [2021-10-11 02:23:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:06,504 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:06,504 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:06,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 02:23:06,504 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 247991696, now seen corresponding path program 1 times [2021-10-11 02:23:06,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:06,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051000210] [2021-10-11 02:23:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:06,618 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:06,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051000210] [2021-10-11 02:23:06,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:06,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:06,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109344679] [2021-10-11 02:23:06,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:06,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:06,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:06,621 INFO L87 Difference]: Start difference. First operand 280 states and 341 transitions. Second operand 5 states. [2021-10-11 02:23:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,018 INFO L93 Difference]: Finished difference Result 333 states and 406 transitions. [2021-10-11 02:23:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:07,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-10-11 02:23:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,021 INFO L225 Difference]: With dead ends: 333 [2021-10-11 02:23:07,022 INFO L226 Difference]: Without dead ends: 329 [2021-10-11 02:23:07,022 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:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-10-11 02:23:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2021-10-11 02:23:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-10-11 02:23:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 341 transitions. [2021-10-11 02:23:07,054 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 341 transitions. Word has length 26 [2021-10-11 02:23:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,054 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 341 transitions. [2021-10-11 02:23:07,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 341 transitions. [2021-10-11 02:23:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:07,055 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,055 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:07,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-11 02:23:07,056 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash 877012396, now seen corresponding path program 1 times [2021-10-11 02:23:07,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644839396] [2021-10-11 02:23:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,140 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:07,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644839396] [2021-10-11 02:23:07,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:07,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405666335] [2021-10-11 02:23:07,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:07,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:07,142 INFO L87 Difference]: Start difference. First operand 280 states and 341 transitions. Second operand 6 states. [2021-10-11 02:23:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,395 INFO L93 Difference]: Finished difference Result 312 states and 373 transitions. [2021-10-11 02:23:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:23:07,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2021-10-11 02:23:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,398 INFO L225 Difference]: With dead ends: 312 [2021-10-11 02:23:07,399 INFO L226 Difference]: Without dead ends: 294 [2021-10-11 02:23:07,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:23:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-11 02:23:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 274. [2021-10-11 02:23:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2021-10-11 02:23:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 324 transitions. [2021-10-11 02:23:07,432 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 324 transitions. Word has length 26 [2021-10-11 02:23:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,433 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 324 transitions. [2021-10-11 02:23:07,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 324 transitions. [2021-10-11 02:23:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:23:07,434 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,434 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:07,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-11 02:23:07,435 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1393529497, now seen corresponding path program 1 times [2021-10-11 02:23:07,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303288783] [2021-10-11 02:23:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,469 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:07,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303288783] [2021-10-11 02:23:07,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:07,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050434298] [2021-10-11 02:23:07,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:07,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:07,471 INFO L87 Difference]: Start difference. First operand 274 states and 324 transitions. Second operand 3 states. [2021-10-11 02:23:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:07,676 INFO L93 Difference]: Finished difference Result 302 states and 352 transitions. [2021-10-11 02:23:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:07,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-10-11 02:23:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:07,679 INFO L225 Difference]: With dead ends: 302 [2021-10-11 02:23:07,679 INFO L226 Difference]: Without dead ends: 261 [2021-10-11 02:23:07,680 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:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-11 02:23:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2021-10-11 02:23:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2021-10-11 02:23:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 300 transitions. [2021-10-11 02:23:07,719 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 300 transitions. Word has length 26 [2021-10-11 02:23:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:07,720 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 300 transitions. [2021-10-11 02:23:07,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 300 transitions. [2021-10-11 02:23:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:07,721 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:07,721 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:07,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-11 02:23:07,722 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -232284809, now seen corresponding path program 1 times [2021-10-11 02:23:07,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:07,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356847336] [2021-10-11 02:23:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:07,807 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:07,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356847336] [2021-10-11 02:23:07,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:07,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:23:07,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514045154] [2021-10-11 02:23:07,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:07,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:07,810 INFO L87 Difference]: Start difference. First operand 253 states and 300 transitions. Second operand 4 states. [2021-10-11 02:23:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,039 INFO L93 Difference]: Finished difference Result 258 states and 305 transitions. [2021-10-11 02:23:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:08,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-10-11 02:23:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,042 INFO L225 Difference]: With dead ends: 258 [2021-10-11 02:23:08,042 INFO L226 Difference]: Without dead ends: 255 [2021-10-11 02:23:08,043 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:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-11 02:23:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-10-11 02:23:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2021-10-11 02:23:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2021-10-11 02:23:08,079 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 27 [2021-10-11 02:23:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,079 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2021-10-11 02:23:08,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2021-10-11 02:23:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:23:08,081 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,081 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:08,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-11 02:23:08,081 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -232272893, now seen corresponding path program 1 times [2021-10-11 02:23:08,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884703228] [2021-10-11 02:23:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,162 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:08,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884703228] [2021-10-11 02:23:08,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:08,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:08,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679844448] [2021-10-11 02:23:08,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:08,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:08,165 INFO L87 Difference]: Start difference. First operand 255 states and 302 transitions. Second operand 5 states. [2021-10-11 02:23:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,434 INFO L93 Difference]: Finished difference Result 284 states and 328 transitions. [2021-10-11 02:23:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:08,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-10-11 02:23:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,438 INFO L225 Difference]: With dead ends: 284 [2021-10-11 02:23:08,438 INFO L226 Difference]: Without dead ends: 255 [2021-10-11 02:23:08,438 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:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-11 02:23:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 236. [2021-10-11 02:23:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 281 transitions. [2021-10-11 02:23:08,469 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 281 transitions. Word has length 27 [2021-10-11 02:23:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,469 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 281 transitions. [2021-10-11 02:23:08,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 281 transitions. [2021-10-11 02:23:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 02:23:08,471 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,471 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] [2021-10-11 02:23:08,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-11 02:23:08,471 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1346387880, now seen corresponding path program 1 times [2021-10-11 02:23:08,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956287073] [2021-10-11 02:23:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,536 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:08,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956287073] [2021-10-11 02:23:08,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:08,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:08,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643019616] [2021-10-11 02:23:08,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:08,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:08,538 INFO L87 Difference]: Start difference. First operand 236 states and 281 transitions. Second operand 5 states. [2021-10-11 02:23:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:08,851 INFO L93 Difference]: Finished difference Result 266 states and 315 transitions. [2021-10-11 02:23:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:08,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-10-11 02:23:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:08,853 INFO L225 Difference]: With dead ends: 266 [2021-10-11 02:23:08,853 INFO L226 Difference]: Without dead ends: 264 [2021-10-11 02:23:08,855 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:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-11 02:23:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 236. [2021-10-11 02:23:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 02:23:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 281 transitions. [2021-10-11 02:23:08,882 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 281 transitions. Word has length 28 [2021-10-11 02:23:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:08,882 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 281 transitions. [2021-10-11 02:23:08,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 281 transitions. [2021-10-11 02:23:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 02:23:08,884 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:08,884 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:08,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-11 02:23:08,884 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1189312573, now seen corresponding path program 1 times [2021-10-11 02:23:08,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:08,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724253298] [2021-10-11 02:23:08,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:08,937 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:08,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724253298] [2021-10-11 02:23:08,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:08,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:08,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168834406] [2021-10-11 02:23:08,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:08,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:08,942 INFO L87 Difference]: Start difference. First operand 236 states and 281 transitions. Second operand 5 states. [2021-10-11 02:23:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,089 INFO L93 Difference]: Finished difference Result 250 states and 294 transitions. [2021-10-11 02:23:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:09,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2021-10-11 02:23:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,092 INFO L225 Difference]: With dead ends: 250 [2021-10-11 02:23:09,092 INFO L226 Difference]: Without dead ends: 233 [2021-10-11 02:23:09,093 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:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-11 02:23:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-11 02:23:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-10-11 02:23:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2021-10-11 02:23:09,122 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 29 [2021-10-11 02:23:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,123 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2021-10-11 02:23:09,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2021-10-11 02:23:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 02:23:09,124 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,124 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:09,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-11 02:23:09,125 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1500342425, now seen corresponding path program 1 times [2021-10-11 02:23:09,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146288221] [2021-10-11 02:23:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,178 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,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146288221] [2021-10-11 02:23:09,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:09,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212859109] [2021-10-11 02:23:09,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:09,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:09,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:09,180 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand 5 states. [2021-10-11 02:23:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,262 INFO L93 Difference]: Finished difference Result 259 states and 303 transitions. [2021-10-11 02:23:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:09,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2021-10-11 02:23:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,265 INFO L225 Difference]: With dead ends: 259 [2021-10-11 02:23:09,265 INFO L226 Difference]: Without dead ends: 233 [2021-10-11 02:23:09,265 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:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-11 02:23:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-11 02:23:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-10-11 02:23:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 275 transitions. [2021-10-11 02:23:09,294 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 275 transitions. Word has length 29 [2021-10-11 02:23:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,294 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 275 transitions. [2021-10-11 02:23:09,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 275 transitions. [2021-10-11 02:23:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:23:09,295 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,295 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:09,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-11 02:23:09,296 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1947939922, now seen corresponding path program 1 times [2021-10-11 02:23:09,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878186847] [2021-10-11 02:23:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,373 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,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878186847] [2021-10-11 02:23:09,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:09,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706199656] [2021-10-11 02:23:09,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:09,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:09,376 INFO L87 Difference]: Start difference. First operand 233 states and 275 transitions. Second operand 5 states. [2021-10-11 02:23:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,569 INFO L93 Difference]: Finished difference Result 254 states and 293 transitions. [2021-10-11 02:23:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:09,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-10-11 02:23:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,571 INFO L225 Difference]: With dead ends: 254 [2021-10-11 02:23:09,571 INFO L226 Difference]: Without dead ends: 235 [2021-10-11 02:23:09,572 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:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-11 02:23:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2021-10-11 02:23:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2021-10-11 02:23:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2021-10-11 02:23:09,596 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 30 [2021-10-11 02:23:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,596 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2021-10-11 02:23:09,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2021-10-11 02:23:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:23:09,597 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,597 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:09,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-11 02:23:09,597 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1292252667, now seen corresponding path program 1 times [2021-10-11 02:23:09,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526711165] [2021-10-11 02:23:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,640 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,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526711165] [2021-10-11 02:23:09,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:09,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138544731] [2021-10-11 02:23:09,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:09,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:09,642 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 4 states. [2021-10-11 02:23:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,804 INFO L93 Difference]: Finished difference Result 267 states and 317 transitions. [2021-10-11 02:23:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:09,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2021-10-11 02:23:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,806 INFO L225 Difference]: With dead ends: 267 [2021-10-11 02:23:09,806 INFO L226 Difference]: Without dead ends: 261 [2021-10-11 02:23:09,809 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:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-11 02:23:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2021-10-11 02:23:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2021-10-11 02:23:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2021-10-11 02:23:09,833 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 30 [2021-10-11 02:23:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,833 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2021-10-11 02:23:09,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2021-10-11 02:23:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-11 02:23:09,834 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,834 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] [2021-10-11 02:23:09,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-11 02:23:09,835 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1450983105, now seen corresponding path program 1 times [2021-10-11 02:23:09,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713978119] [2021-10-11 02:23:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:09,886 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,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713978119] [2021-10-11 02:23:09,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:09,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:09,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612777117] [2021-10-11 02:23:09,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:09,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:09,888 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 5 states. [2021-10-11 02:23:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:09,945 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2021-10-11 02:23:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:09,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2021-10-11 02:23:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:09,947 INFO L225 Difference]: With dead ends: 233 [2021-10-11 02:23:09,947 INFO L226 Difference]: Without dead ends: 183 [2021-10-11 02:23:09,947 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:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-10-11 02:23:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2021-10-11 02:23:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2021-10-11 02:23:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2021-10-11 02:23:09,967 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 31 [2021-10-11 02:23:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:09,967 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2021-10-11 02:23:09,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2021-10-11 02:23:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-11 02:23:09,968 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:09,968 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:09,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-11 02:23:09,968 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 820499997, now seen corresponding path program 1 times [2021-10-11 02:23:09,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:09,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284391614] [2021-10-11 02:23:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,073 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,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284391614] [2021-10-11 02:23:10,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:10,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292507656] [2021-10-11 02:23:10,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:10,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:10,075 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand 6 states. [2021-10-11 02:23:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,262 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2021-10-11 02:23:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:10,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2021-10-11 02:23:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,264 INFO L225 Difference]: With dead ends: 187 [2021-10-11 02:23:10,264 INFO L226 Difference]: Without dead ends: 121 [2021-10-11 02:23:10,264 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:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-11 02:23:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2021-10-11 02:23:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-10-11 02:23:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2021-10-11 02:23:10,277 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 33 [2021-10-11 02:23:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,277 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2021-10-11 02:23:10,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2021-10-11 02:23:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:23:10,278 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,278 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:10,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-11 02:23:10,278 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1588816419, now seen corresponding path program 1 times [2021-10-11 02:23:10,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672961166] [2021-10-11 02:23:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,350 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,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672961166] [2021-10-11 02:23:10,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:10,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569353530] [2021-10-11 02:23:10,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:10,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:10,351 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand 5 states. [2021-10-11 02:23:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,492 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2021-10-11 02:23:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:10,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2021-10-11 02:23:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,493 INFO L225 Difference]: With dead ends: 138 [2021-10-11 02:23:10,494 INFO L226 Difference]: Without dead ends: 136 [2021-10-11 02:23:10,494 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:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-11 02:23:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2021-10-11 02:23:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-10-11 02:23:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2021-10-11 02:23:10,506 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 36 [2021-10-11 02:23:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,506 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2021-10-11 02:23:10,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2021-10-11 02:23:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:23:10,507 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,507 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:10,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-11 02:23:10,508 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -247616008, now seen corresponding path program 1 times [2021-10-11 02:23:10,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832547535] [2021-10-11 02:23:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,583 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,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832547535] [2021-10-11 02:23:10,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:23:10,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499995485] [2021-10-11 02:23:10,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:23:10,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:23:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:23:10,586 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 7 states. [2021-10-11 02:23:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,739 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2021-10-11 02:23:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:10,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2021-10-11 02:23:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,740 INFO L225 Difference]: With dead ends: 107 [2021-10-11 02:23:10,740 INFO L226 Difference]: Without dead ends: 91 [2021-10-11 02:23:10,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:23:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-10-11 02:23:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-10-11 02:23:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-10-11 02:23:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2021-10-11 02:23:10,753 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 40 [2021-10-11 02:23:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,753 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2021-10-11 02:23:10,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:23:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2021-10-11 02:23:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:23:10,754 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,754 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:10,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-11 02:23:10,754 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1413129383, now seen corresponding path program 1 times [2021-10-11 02:23:10,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014612478] [2021-10-11 02:23:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,820 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,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014612478] [2021-10-11 02:23:10,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:10,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830379536] [2021-10-11 02:23:10,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:10,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:10,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:10,822 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 6 states. [2021-10-11 02:23:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:10,927 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2021-10-11 02:23:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:10,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2021-10-11 02:23:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:10,929 INFO L225 Difference]: With dead ends: 111 [2021-10-11 02:23:10,929 INFO L226 Difference]: Without dead ends: 93 [2021-10-11 02:23:10,929 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:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-11 02:23:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-10-11 02:23:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-10-11 02:23:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2021-10-11 02:23:10,942 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 40 [2021-10-11 02:23:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:10,942 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2021-10-11 02:23:10,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2021-10-11 02:23:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:10,943 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:10,943 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] [2021-10-11 02:23:10,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-11 02:23:10,944 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 532799929, now seen corresponding path program 1 times [2021-10-11 02:23:10,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:10,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064624262] [2021-10-11 02:23:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:10,985 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,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064624262] [2021-10-11 02:23:10,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:10,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:10,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819613922] [2021-10-11 02:23:10,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:10,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:10,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:10,987 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 5 states. [2021-10-11 02:23:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,063 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2021-10-11 02:23:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:11,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2021-10-11 02:23:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,065 INFO L225 Difference]: With dead ends: 215 [2021-10-11 02:23:11,065 INFO L226 Difference]: Without dead ends: 167 [2021-10-11 02:23:11,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-11 02:23:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 93. [2021-10-11 02:23:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-10-11 02:23:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2021-10-11 02:23:11,082 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 43 [2021-10-11 02:23:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,082 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2021-10-11 02:23:11,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2021-10-11 02:23:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:11,083 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,083 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] [2021-10-11 02:23:11,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-11 02:23:11,084 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash 624558776, now seen corresponding path program 1 times [2021-10-11 02:23:11,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377638819] [2021-10-11 02:23:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,140 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,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377638819] [2021-10-11 02:23:11,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:11,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537106926] [2021-10-11 02:23:11,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:11,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:11,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:11,142 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 6 states. [2021-10-11 02:23:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,252 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2021-10-11 02:23:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:23:11,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2021-10-11 02:23:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,254 INFO L225 Difference]: With dead ends: 107 [2021-10-11 02:23:11,254 INFO L226 Difference]: Without dead ends: 69 [2021-10-11 02:23:11,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-11 02:23:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-11 02:23:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 02:23:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-10-11 02:23:11,268 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 43 [2021-10-11 02:23:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,268 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-10-11 02:23:11,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2021-10-11 02:23:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:23:11,269 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,269 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] [2021-10-11 02:23:11,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-11 02:23:11,269 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1262361160, now seen corresponding path program 1 times [2021-10-11 02:23:11,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658845291] [2021-10-11 02:23:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,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:11,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658845291] [2021-10-11 02:23:11,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:23:11,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490921888] [2021-10-11 02:23:11,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:11,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:11,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:23:11,317 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 4 states. [2021-10-11 02:23:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,372 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2021-10-11 02:23:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:11,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2021-10-11 02:23:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,373 INFO L225 Difference]: With dead ends: 97 [2021-10-11 02:23:11,374 INFO L226 Difference]: Without dead ends: 69 [2021-10-11 02:23:11,374 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,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-11 02:23:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-11 02:23:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 02:23:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2021-10-11 02:23:11,387 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 43 [2021-10-11 02:23:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,387 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2021-10-11 02:23:11,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2021-10-11 02:23:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-11 02:23:11,388 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,388 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] [2021-10-11 02:23:11,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-11 02:23:11,388 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -503204252, now seen corresponding path program 1 times [2021-10-11 02:23:11,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974511849] [2021-10-11 02:23:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,471 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,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974511849] [2021-10-11 02:23:11,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:23:11,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049957340] [2021-10-11 02:23:11,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:23:11,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:23:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:11,476 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2021-10-11 02:23:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:11,591 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-10-11 02:23:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:23:11,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2021-10-11 02:23:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:11,592 INFO L225 Difference]: With dead ends: 87 [2021-10-11 02:23:11,592 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 02:23:11,592 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:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 02:23:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-11 02:23:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:23:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2021-10-11 02:23:11,603 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 52 [2021-10-11 02:23:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:11,604 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2021-10-11 02:23:11,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:23:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2021-10-11 02:23:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-11 02:23:11,610 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:11,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, 1, 1, 1, 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:11,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-11 02:23:11,610 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -225825622, now seen corresponding path program 1 times [2021-10-11 02:23:11,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:11,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527149402] [2021-10-11 02:23:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:11,738 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,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527149402] [2021-10-11 02:23:11,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:11,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-11 02:23:11,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674215630] [2021-10-11 02:23:11,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-10-11 02:23:11,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:11,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 02:23:11,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-11 02:23:11,740 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 10 states. [2021-10-11 02:23:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,056 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2021-10-11 02:23:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:23:12,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2021-10-11 02:23:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,058 INFO L225 Difference]: With dead ends: 92 [2021-10-11 02:23:12,058 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 02:23:12,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:23:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 02:23:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-10-11 02:23:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:23:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-10-11 02:23:12,075 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 54 [2021-10-11 02:23:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,077 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-10-11 02:23:12,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-10-11 02:23:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-10-11 02:23:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:23:12,078 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,079 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, 1, 1, 1] [2021-10-11 02:23:12,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-11 02:23:12,079 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash 95179858, now seen corresponding path program 1 times [2021-10-11 02:23:12,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980322524] [2021-10-11 02:23:12,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,218 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,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980322524] [2021-10-11 02:23:12,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:23:12,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157629479] [2021-10-11 02:23:12,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:23:12,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:23:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:23:12,221 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2021-10-11 02:23:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,324 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-10-11 02:23:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:23:12,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2021-10-11 02:23:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,325 INFO L225 Difference]: With dead ends: 96 [2021-10-11 02:23:12,326 INFO L226 Difference]: Without dead ends: 67 [2021-10-11 02:23:12,326 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,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-11 02:23:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-10-11 02:23:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 02:23:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2021-10-11 02:23:12,343 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2021-10-11 02:23:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,343 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-10-11 02:23:12,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:23:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2021-10-11 02:23:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:23:12,344 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:12,344 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, 1, 1, 1] [2021-10-11 02:23:12,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-11 02:23:12,345 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:12,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:12,346 INFO L82 PathProgramCache]: Analyzing trace with hash 713024051, now seen corresponding path program 1 times [2021-10-11 02:23:12,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:12,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834890776] [2021-10-11 02:23:12,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:12,497 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,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834890776] [2021-10-11 02:23:12,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:12,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-11 02:23:12,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378620015] [2021-10-11 02:23:12,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:12,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:12,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:12,500 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2021-10-11 02:23:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:12,833 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-10-11 02:23:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:23:12,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2021-10-11 02:23:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:12,834 INFO L225 Difference]: With dead ends: 79 [2021-10-11 02:23:12,834 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:23:12,835 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:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:23:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:23:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:23:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:23:12,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-10-11 02:23:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:12,836 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:23:12,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:23:12,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:23:12,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-11 02:23:12,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:23:13,187 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 214 [2021-10-11 02:23:13,570 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 107 [2021-10-11 02:23:14,179 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 192 [2021-10-11 02:23:14,478 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 184 [2021-10-11 02:23:14,686 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 194 [2021-10-11 02:23:14,942 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2021-10-11 02:23:15,232 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2021-10-11 02:23:15,422 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-10-11 02:23:16,382 WARN L197 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 107 [2021-10-11 02:23:16,775 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-10-11 02:23:17,022 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-10-11 02:23:17,472 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 68 [2021-10-11 02:23:18,089 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2021-10-11 02:23:18,224 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-10-11 02:23:18,529 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2021-10-11 02:23:18,753 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2021-10-11 02:23:18,873 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-10-11 02:23:19,003 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-10-11 02:23:19,123 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2021-10-11 02:23:19,538 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2021-10-11 02:23:19,681 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2021-10-11 02:23:19,847 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2021-10-11 02:23:20,099 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2021-10-11 02:23:20,311 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-10-11 02:23:20,548 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-10-11 02:23:20,812 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2021-10-11 02:23:20,952 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2021-10-11 02:23:21,138 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2021-10-11 02:23:21,451 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-10-11 02:23:21,694 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2021-10-11 02:23:21,883 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2021-10-11 02:23:22,488 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2021-10-11 02:23:23,186 WARN L197 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 107 [2021-10-11 02:23:23,304 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2021-10-11 02:23:23,787 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2021-10-11 02:23:24,523 WARN L197 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 106 [2021-10-11 02:23:25,074 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2021-10-11 02:23:25,294 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2021-10-11 02:23:25,572 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-10-11 02:23:26,406 WARN L197 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 107 [2021-10-11 02:23:26,785 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2021-10-11 02:23:27,194 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2021-10-11 02:23:27,757 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-2(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-4(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-6(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-8(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-10(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-12(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-14(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-16(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-18(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1026-20(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L236-1(lines 229 417) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L1297(lines 1297 1311) no Hoare annotation was computed. [2021-10-11 02:23:27,812 INFO L262 CegarLoopResult]: For program point L240(lines 240 246) no Hoare annotation was computed. [2021-10-11 02:23:27,813 INFO L262 CegarLoopResult]: For program point L637(lines 637 642) no Hoare annotation was computed. [2021-10-11 02:23:27,813 INFO L262 CegarLoopResult]: For program point L637-2(lines 637 642) no Hoare annotation was computed. [2021-10-11 02:23:27,813 INFO L258 CegarLoopResult]: At program point L1562(lines 1183 1564) the Hoare annotation is: (let ((.cse1 (= ~pended~0 1)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (not (= ~IPC~0 2))) (.cse10 (= ~NP~0 1)) (.cse8 (= ~pended~0 0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (= ~s~0 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse11 (not (= ~MPR3~0 1))) (.cse5 (= 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 2))) (.cse9 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse4 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res|) .cse5 .cse9 .cse0 .cse10 (<= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) (<= 4 ~SKIP2~0) .cse2 (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse11) (and .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6) (and .cse0 .cse10 .cse8 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse7 .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse4 .cse5 .cse9 .cse0 .cse10 .cse2 .cse3 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse11 .cse6) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse0 .cse10 .cse8 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0)))) [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point L1298(lines 1298 1304) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point L377(lines 377 383) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,814 INFO L258 CegarLoopResult]: At program point L644(lines 612 646) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse5 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 0 .cse18)) (.cse7 (<= .cse18 0)) (.cse8 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0))) (.cse9 (= ~compRegistered~0 1)) (.cse10 (= 2 ~DC~0)) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (not (= ~IPC~0 2))) (.cse13 (= ~s~0 1)) (.cse14 (= ~NP~0 1)) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse15 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse16 .cse17)))) [2021-10-11 02:23:27,815 INFO L262 CegarLoopResult]: For program point L512(lines 512 517) no Hoare annotation was computed. [2021-10-11 02:23:27,815 INFO L258 CegarLoopResult]: At program point L512-2(lines 512 517) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= 2 ~DC~0) (= ~compRegistered~0 1) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,815 INFO L258 CegarLoopResult]: At program point L118(lines 118 148) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,815 INFO L262 CegarLoopResult]: For program point L118-2(lines 110 158) no Hoare annotation was computed. [2021-10-11 02:23:27,815 INFO L262 CegarLoopResult]: For program point L1043(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,815 INFO L258 CegarLoopResult]: At program point L118-3(lines 118 148) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,815 INFO L262 CegarLoopResult]: For program point L1043-2(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L118-5(lines 110 158) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-4(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-6(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-8(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-10(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-12(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-14(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,816 INFO L262 CegarLoopResult]: For program point L1043-16(lines 1043 1049) no Hoare annotation was computed. [2021-10-11 02:23:27,817 INFO L262 CegarLoopResult]: For program point L781(lines 781 785) no Hoare annotation was computed. [2021-10-11 02:23:27,818 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,818 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,819 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,819 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,819 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,820 INFO L258 CegarLoopResult]: At program point L787(lines 780 835) the Hoare annotation is: (let ((.cse13 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse17 (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1))) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse3 (= ~pended~0 1)) (.cse4 (= ~compRegistered~0 0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= ULTIMATE.start_main_~status~1 258)) (.cse16 (<= 4 ~SKIP2~0)) (.cse18 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse1 (not (= ~IPC~0 2))) (.cse10 (= ~pended~0 0)) (.cse2 (= ~NP~0 1)) (.cse11 (= ~s~0 ~DC~0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (not (= ~SKIP2~0 2))) (.cse9 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s~0 1)) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse7 .cse9 .cse1 .cse2 .cse11 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse6 .cse8 (or (<= 260 ULTIMATE.start_main_~status~1) .cse12)) (and .cse1 .cse10 .cse2 .cse11 .cse13 .cse6 .cse7 .cse8 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse0 .cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse14 .cse15 .cse7 .cse9 .cse1 .cse2 .cse16 .cse17 .cse5 .cse18 .cse6 .cse8 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (and .cse10 .cse4 .cse11 (= ULTIMATE.start_main_~status~1 0)) (and .cse1 .cse10 .cse2 .cse11 .cse13 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse6 .cse7 .cse8) (and .cse0 .cse10 .cse14 .cse15 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res|) .cse7 .cse9 .cse1 .cse2 (<= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse16 .cse17 .cse5 .cse18 .cse6 .cse8) (and .cse1 .cse3 .cse4 .cse11 .cse7 .cse8) (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse10 .cse14 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse7 .cse12 .cse9 .cse1 .cse2 .cse11 .cse16 .cse18 .cse6 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse8) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse1 .cse10 .cse2 .cse11 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) .cse8 .cse9 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0)))) [2021-10-11 02:23:27,820 INFO L258 CegarLoopResult]: At program point L1316(lines 1316 1550) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,820 INFO L262 CegarLoopResult]: For program point L260(lines 260 291) no Hoare annotation was computed. [2021-10-11 02:23:27,820 INFO L262 CegarLoopResult]: For program point L789(lines 789 793) no Hoare annotation was computed. [2021-10-11 02:23:27,820 INFO L258 CegarLoopResult]: At program point L129(lines 129 136) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,821 INFO L258 CegarLoopResult]: At program point L129-1(lines 129 136) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,821 INFO L262 CegarLoopResult]: For program point L1452(lines 1452 1455) no Hoare annotation was computed. [2021-10-11 02:23:27,821 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,821 INFO L262 CegarLoopResult]: For program point L528(lines 528 593) no Hoare annotation was computed. [2021-10-11 02:23:27,821 INFO L262 CegarLoopResult]: For program point L528-1(lines 528 593) no Hoare annotation was computed. [2021-10-11 02:23:27,821 INFO L258 CegarLoopResult]: At program point L1321(lines 1321 1548) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,821 INFO L262 CegarLoopResult]: For program point L530(lines 530 570) no Hoare annotation was computed. [2021-10-11 02:23:27,822 INFO L258 CegarLoopResult]: At program point L795(lines 788 834) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_main_~status~1 258)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse7 (<= 4 ~SKIP2~0)) (.cse13 (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1))) (.cse9 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse16 (= ~pended~0 1)) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse4 (<= 3 ~SKIP1~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~NP~0 1)) (.cse8 (= ~s~0 ~DC~0)) (.cse15 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse10 (not (= ~MPR3~0 1))) (.cse2 (= 2 ~DC~0)) (.cse11 (not (= ~SKIP2~0 2)))) (or (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse1 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse11) (and .cse0 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse2 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse10 .cse11 (or (<= 260 ULTIMATE.start_main_~status~1) .cse3)) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5 .cse6 .cse8 .cse10 .cse2 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) .cse11 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0)) (and .cse0 .cse1 .cse12 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res|) .cse2 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse7 .cse13 .cse14 .cse9 .cse10 .cse11) (and (= ~pended~0 0) (= ~compRegistered~0 0) .cse8 (= ULTIMATE.start_main_~status~1 0)) (and .cse5 .cse6 .cse8 .cse15 .cse10 .cse2 .cse11 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse0 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse9 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (and .cse5 .cse16 .cse8 .cse2 .cse11) (and .cse0 .cse5 .cse6 .cse16 .cse14 (not (= ~s~0 1)) .cse10 .cse2 .cse11 .cse4) (and .cse5 .cse6 .cse8 .cse15 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse2 .cse11))) [2021-10-11 02:23:27,822 INFO L258 CegarLoopResult]: At program point L531(lines 531 541) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,823 INFO L265 CegarLoopResult]: At program point L796(lines 780 835) the Hoare annotation is: true [2021-10-11 02:23:27,823 INFO L258 CegarLoopResult]: At program point L664(lines 724 726) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,823 INFO L262 CegarLoopResult]: For program point L797(lines 797 832) no Hoare annotation was computed. [2021-10-11 02:23:27,823 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,823 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,823 INFO L262 CegarLoopResult]: For program point L798(lines 798 831) no Hoare annotation was computed. [2021-10-11 02:23:27,823 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L262 CegarLoopResult]: For program point L1591-2(lines 1589 1620) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L262 CegarLoopResult]: For program point L799(lines 799 809) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L262 CegarLoopResult]: For program point L271(lines 271 277) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L262 CegarLoopResult]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-10-11 02:23:27,824 INFO L258 CegarLoopResult]: At program point L1594-1(lines 1594 1618) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~compRegistered~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 2)))) (or (and .cse0 (= ~pended~0 1) .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 .cse4) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse0 (= ~NP~0 1) (= ~pended~0 0) .cse1 (= ~s~0 ~DC~0) .cse2 (not (= ~MPR3~0 1)) .cse3 .cse4 (<= 3 ~SKIP1~0)))) [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1462(lines 1462 1482) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1330(lines 1330 1546) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1066(lines 1066 1085) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1066-1(lines 1066 1085) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1066-2(lines 1066 1085) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1066-3(lines 1066 1085) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1463(lines 1463 1466) no Hoare annotation was computed. [2021-10-11 02:23:27,825 INFO L262 CegarLoopResult]: For program point L1067(lines 1067 1072) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point L1067-2(lines 1067 1072) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point L1067-4(lines 1067 1072) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point L1067-6(lines 1067 1072) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point L144(lines 144 146) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point L144-1(lines 144 146) no Hoare annotation was computed. [2021-10-11 02:23:27,826 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,827 INFO L258 CegarLoopResult]: At program point L543(lines 530 570) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,827 INFO L262 CegarLoopResult]: For program point L1468(lines 1468 1481) no Hoare annotation was computed. [2021-10-11 02:23:27,827 INFO L258 CegarLoopResult]: At program point L1074(lines 1066 1085) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (or (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,827 INFO L258 CegarLoopResult]: At program point L1074-1(lines 1066 1085) the Hoare annotation is: false [2021-10-11 02:23:27,828 INFO L258 CegarLoopResult]: At program point L1074-2(lines 1066 1085) the Hoare annotation is: (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 1)) (.cse3 (= ~NP~0 1)) (.cse4 (= ~compRegistered~0 0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (not (= ~MPR3~0 ~s~0))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 (= ~pended~0 0) .cse2 .cse3 (<= 4 ~SKIP2~0) .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~pended~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,828 INFO L258 CegarLoopResult]: At program point L1074-3(lines 1066 1085) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 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) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= 4 ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (= ~myStatus~0 0) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,828 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,828 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,828 INFO L262 CegarLoopResult]: For program point L1339(lines 1339 1544) no Hoare annotation was computed. [2021-10-11 02:23:27,829 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,829 INFO L258 CegarLoopResult]: At program point L811(lines 798 831) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_main_~status~1 258)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse4 (<= 3 ~SKIP1~0)) (.cse7 (<= 4 ~SKIP2~0)) (.cse13 (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1))) (.cse14 (not (= 2 ~s~0))) (.cse9 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (not (= ~IPC~0 2))) (.cse6 (= ~NP~0 1)) (.cse8 (= ~s~0 ~DC~0)) (.cse15 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse10 (not (= ~MPR3~0 1))) (.cse2 (= 2 ~DC~0)) (.cse11 (not (= ~SKIP2~0 2)))) (or (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse1 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse11) (and .cse0 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse2 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse8 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse10 .cse11 (or (<= 260 ULTIMATE.start_main_~status~1) .cse3)) (and .cse0 .cse1 .cse12 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res|) .cse2 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse7 .cse13 .cse14 .cse9 .cse10) (and (= ~pended~0 0) (= ~compRegistered~0 0) .cse8 (= ULTIMATE.start_main_~status~1 0)) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse5 .cse6 .cse8 .cse10 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) .cse2 .cse11 .cse4 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0)) (and .cse5 .cse6 .cse8 .cse15 .cse10 .cse2 .cse11 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse5 (= ~pended~0 1) .cse2 .cse11) (and .cse0 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse9 .cse10 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (and .cse5 .cse6 .cse8 .cse15 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse2 .cse11))) [2021-10-11 02:23:27,829 INFO L262 CegarLoopResult]: For program point L1472(lines 1472 1480) no Hoare annotation was computed. [2021-10-11 02:23:27,829 INFO L258 CegarLoopResult]: At program point L1340(lines 1330 1546) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,830 INFO L258 CegarLoopResult]: At program point L550-2(lines 550 566) the Hoare annotation is: (let ((.cse17 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse5 (<= 0 .cse17)) (.cse6 (<= .cse17 0)) (.cse7 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0))) (.cse8 (= ~compRegistered~0 1)) (.cse9 (= 2 ~DC~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse11 (not (= ~IPC~0 2))) (.cse12 (= ~s~0 1)) (.cse13 (= ~NP~0 1)) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:27,830 INFO L258 CegarLoopResult]: At program point L418(lines 229 419) the Hoare annotation is: (let ((.cse5 (= ~s~0 ~DC~0)) (.cse3 (= ~pended~0 0)) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (<= 4 ~SKIP2~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= ~IPC~0 2))) (.cse12 (= ~pended~0 1)) (.cse2 (= ~NP~0 1)) (.cse13 (= ~compRegistered~0 0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (= 2 ~DC~0)) (.cse14 (not (= ~SKIP2~0 2))) (.cse9 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse7 .cse8 .cse9) (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse3 .cse6 .cse10 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse11 .cse7) (and .cse1 .cse12 (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse13 .cse5 .cse6 .cse8 .cse14) (and .cse0 .cse3 .cse6 .cse10 .cse8 .cse9 .cse1 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse4 .cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse11 .cse7) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse6 .cse15 .cse7 .cse8 .cse14 .cse9))) [2021-10-11 02:23:27,830 INFO L262 CegarLoopResult]: For program point L1079(lines 1079 1083) no Hoare annotation was computed. [2021-10-11 02:23:27,831 INFO L258 CegarLoopResult]: At program point L1079-1(lines 1079 1083) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= 2 ~DC~0) (= ~compRegistered~0 1) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,831 INFO L262 CegarLoopResult]: For program point L1079-2(lines 1079 1083) no Hoare annotation was computed. [2021-10-11 02:23:27,831 INFO L258 CegarLoopResult]: At program point L1079-3(lines 1079 1083) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (or (= 259 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,831 INFO L262 CegarLoopResult]: For program point L1079-4(lines 1079 1083) no Hoare annotation was computed. [2021-10-11 02:23:27,831 INFO L258 CegarLoopResult]: At program point L1079-5(lines 1079 1083) the Hoare annotation is: (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 1)) (.cse3 (= ~NP~0 1)) (.cse4 (= ~compRegistered~0 0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 (= ~pended~0 0) .cse2 .cse3 .cse4 (<= 4 ~SKIP2~0) .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~pended~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,832 INFO L262 CegarLoopResult]: For program point L1079-6(lines 1079 1083) no Hoare annotation was computed. [2021-10-11 02:23:27,832 INFO L258 CegarLoopResult]: At program point L1079-7(lines 1079 1083) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= 2 ~DC~0) (= ~compRegistered~0 1) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= 4 ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (or (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (= ~myStatus~0 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,832 INFO L258 CegarLoopResult]: At program point L551(lines 550 566) the Hoare annotation is: (let ((.cse17 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse5 (<= 0 .cse17)) (.cse6 (<= .cse17 0)) (.cse7 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0))) (.cse8 (= ~compRegistered~0 1)) (.cse9 (= 2 ~DC~0)) (.cse10 (<= 3 ~SKIP1~0)) (.cse11 (not (= ~IPC~0 2))) (.cse12 (= ~s~0 1)) (.cse13 (= ~NP~0 1)) (.cse14 (<= 4 ~SKIP2~0)) (.cse15 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:27,832 INFO L262 CegarLoopResult]: For program point L1476(lines 1476 1479) no Hoare annotation was computed. [2021-10-11 02:23:27,833 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,833 INFO L262 CegarLoopResult]: For program point L817(lines 817 829) no Hoare annotation was computed. [2021-10-11 02:23:27,833 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,833 INFO L262 CegarLoopResult]: For program point L1610(lines 1610 1616) no Hoare annotation was computed. [2021-10-11 02:23:27,833 INFO L258 CegarLoopResult]: At program point L157(lines 97 159) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~compRegistered~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~DC~0))) (or (and (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse0 (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) .cse1 .cse2 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (not (= ~MPR3~0 1)) .cse3 (<= 3 ~SKIP1~0)) (and .cse0 (= ~pended~0 1) .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 (not (= ~SKIP2~0 2))))) [2021-10-11 02:23:27,833 INFO L258 CegarLoopResult]: At program point L157-1(lines 97 159) the Hoare annotation is: (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~s~0 1)) (.cse3 (= ~NP~0 1)) (.cse4 (= ~compRegistered~0 0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 (= ~pended~0 0) .cse2 .cse3 (<= 4 ~SKIP2~0) .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 (= ~pended~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point L818(lines 818 822) no Hoare annotation was computed. [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point L1348(lines 1348 1542) no Hoare annotation was computed. [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,834 INFO L258 CegarLoopResult]: At program point L1484(lines 1348 1542) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,834 INFO L262 CegarLoopResult]: For program point L295-1(lines 229 417) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L824(lines 824 828) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,835 INFO L262 CegarLoopResult]: For program point L956-12(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L262 CegarLoopResult]: For program point L956-14(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L262 CegarLoopResult]: For program point L956-16(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L262 CegarLoopResult]: For program point L956-18(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L262 CegarLoopResult]: For program point L956-20(lines 956 962) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L262 CegarLoopResult]: For program point L562(lines 562 564) no Hoare annotation was computed. [2021-10-11 02:23:27,836 INFO L258 CegarLoopResult]: At program point L431(lines 160 433) the Hoare annotation is: (let ((.cse9 (= ~s~0 ~DC~0)) (.cse13 (= ~pended~0 1)) (.cse14 (= ~compRegistered~0 0)) (.cse12 (not (= ~SKIP2~0 2))) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (= 2 ~DC~0)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~NP~0 1)) (.cse8 (<= 4 ~SKIP2~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse10 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse11 (not (= ~MPR3~0 1)))) (or (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse1 .cse2 .cse3 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse12) (and .cse6 .cse7 .cse1 .cse9 .cse2 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse11 .cse4 .cse12) (and .cse6 .cse13 (not (= 259 ULTIMATE.start_FloppyPnp_~__cil_tmp29~0)) .cse14 .cse9 .cse2 .cse4 .cse12) (and .cse0 .cse6 .cse13 .cse7 .cse14 .cse2 .cse15 .cse11 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse10 .cse11 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)))) [2021-10-11 02:23:27,837 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,837 INFO L262 CegarLoopResult]: For program point L1357(lines 1357 1540) no Hoare annotation was computed. [2021-10-11 02:23:27,837 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,837 INFO L262 CegarLoopResult]: For program point L301(lines 301 307) no Hoare annotation was computed. [2021-10-11 02:23:27,837 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,837 INFO L258 CegarLoopResult]: At program point L567(lines 528 593) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse4 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse6 (<= 0 .cse18)) (.cse7 (<= .cse18 0)) (.cse8 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0))) (.cse9 (= ~compRegistered~0 1)) (.cse10 (= 2 ~DC~0)) (.cse11 (<= 3 ~SKIP1~0)) (.cse12 (not (= ~IPC~0 2))) (.cse13 (= ~s~0 1)) (.cse14 (= ~NP~0 1)) (.cse15 (<= 4 ~SKIP2~0)) (.cse16 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse17 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse15 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0))))) [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1362(lines 1362 1538) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1627(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1627-2(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1627-3(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,838 INFO L262 CegarLoopResult]: For program point L1627-4(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-5(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-6(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-7(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-8(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-9(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-10(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-11(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,839 INFO L262 CegarLoopResult]: For program point L1627-12(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-13(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-14(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-15(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-16(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-17(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-18(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,840 INFO L262 CegarLoopResult]: For program point L1627-19(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-20(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-21(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-22(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-23(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-24(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-25(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-26(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,841 INFO L262 CegarLoopResult]: For program point L1627-27(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,842 INFO L262 CegarLoopResult]: For program point L1627-28(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,842 INFO L262 CegarLoopResult]: For program point L1627-29(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,842 INFO L262 CegarLoopResult]: For program point L1627-30(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,842 INFO L258 CegarLoopResult]: At program point L1628(lines 1039 1052) the Hoare annotation is: (and (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0)) [2021-10-11 02:23:27,842 INFO L262 CegarLoopResult]: For program point L1627-31(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,842 INFO L258 CegarLoopResult]: At program point L1628-1(lines 1039 1052) the Hoare annotation is: (and (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0)) [2021-10-11 02:23:27,842 INFO L262 CegarLoopResult]: For program point L1627-32(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,843 INFO L258 CegarLoopResult]: At program point L1628-2(lines 1039 1052) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (not (= ~SKIP2~0 2)) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,843 INFO L262 CegarLoopResult]: For program point L1627-33(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,843 INFO L258 CegarLoopResult]: At program point L1628-3(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 1) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (not (= ~SKIP2~0 2))) [2021-10-11 02:23:27,843 INFO L262 CegarLoopResult]: For program point L1627-34(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,843 INFO L258 CegarLoopResult]: At program point L1628-4(lines 1039 1052) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (not (= ~SKIP2~0 2))) [2021-10-11 02:23:27,843 INFO L262 CegarLoopResult]: For program point L1627-35(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,844 INFO L258 CegarLoopResult]: At program point L1628-5(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,844 INFO L262 CegarLoopResult]: For program point L1627-36(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,844 INFO L262 CegarLoopResult]: For program point L1627-37(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,844 INFO L258 CegarLoopResult]: At program point L1628-7(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,844 INFO L262 CegarLoopResult]: For program point L1627-38(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,844 INFO L258 CegarLoopResult]: At program point L1628-8(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 1) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (not (= ~SKIP2~0 2))) [2021-10-11 02:23:27,844 INFO L262 CegarLoopResult]: For program point L1627-39(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,845 INFO L258 CegarLoopResult]: At program point L1628-9(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,845 INFO L262 CegarLoopResult]: For program point L1627-40(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,845 INFO L262 CegarLoopResult]: For program point L1627-41(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,845 INFO L258 CegarLoopResult]: At program point L1628-11(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,845 INFO L262 CegarLoopResult]: For program point L1627-42(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,845 INFO L262 CegarLoopResult]: For program point L1627-43(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,846 INFO L258 CegarLoopResult]: At program point L1628-13(lines 1039 1052) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (not (= ~SKIP2~0 2))) [2021-10-11 02:23:27,846 INFO L262 CegarLoopResult]: For program point L1627-44(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,846 INFO L262 CegarLoopResult]: For program point L1627-45(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,846 INFO L262 CegarLoopResult]: For program point L1627-46(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,846 INFO L262 CegarLoopResult]: For program point L1627-47(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,846 INFO L258 CegarLoopResult]: At program point L1628-17(lines 1 1630) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= ~s~0 ~NP~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)) (or (= ~MPR3~0 ~s~0) (not .cse1)))) [2021-10-11 02:23:27,847 INFO L262 CegarLoopResult]: For program point L1627-48(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,847 INFO L262 CegarLoopResult]: For program point L1627-49(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,847 INFO L262 CegarLoopResult]: For program point L1627-50(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,847 INFO L258 CegarLoopResult]: At program point L1628-20(lines 1 1630) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or (= ~s~0 ~NP~0) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)) (or (= ~MPR3~0 ~s~0) (not .cse1)))) [2021-10-11 02:23:27,847 INFO L262 CegarLoopResult]: For program point L1627-51(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,847 INFO L262 CegarLoopResult]: For program point L1627-52(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,848 INFO L258 CegarLoopResult]: At program point L1628-22(lines 1039 1052) the Hoare annotation is: (let ((.cse17 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse1 (= ~pended~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse16 (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse3 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse4 (<= 0 .cse17)) (.cse5 (<= .cse17 0)) (.cse6 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0))) (.cse7 (= ~compRegistered~0 1)) (.cse8 (<= 3 ~SKIP1~0)) (.cse9 (not (= ~IPC~0 2))) (.cse10 (= ~NP~0 1)) (.cse11 (= 2 ~s~0)) (.cse12 (= ~s~0 ~DC~0)) (.cse13 (<= 4 ~SKIP2~0)) (.cse14 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse15 (not (= ~MPR3~0 1)))) (or (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0)) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0)) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258) .cse13 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258) .cse14 .cse15)))) [2021-10-11 02:23:27,848 INFO L258 CegarLoopResult]: At program point L1628-23(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,848 INFO L258 CegarLoopResult]: At program point L1628-25(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,849 INFO L258 CegarLoopResult]: At program point L1628-26(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 1) (= ~s~0 1) (= ~NP~0 1) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (not (= ~SKIP2~0 2)) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,849 INFO L258 CegarLoopResult]: At program point L1628-28(lines 1 1630) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~NP~0 1)) (.cse2 (<= (+ ~s~0 2) ~MPR1~0)) (.cse3 (= ~compRegistered~0 0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 (= ~pended~0 0) .cse1 .cse2 (<= 4 ~SKIP2~0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,849 INFO L258 CegarLoopResult]: At program point L1628-30(lines 1 1630) the Hoare annotation is: (let ((.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0)) (.cse1 (not (= ~IPC~0 2))) (.cse2 (= ~NP~0 1)) (.cse3 (= ~compRegistered~0 0)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse6 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 (= ~pended~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8) (and .cse0 (= ~pended~0 0) .cse4 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse7 .cse8 .cse1 .cse2 (<= 4 ~SKIP2~0) .cse3 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse6))) [2021-10-11 02:23:27,849 INFO L258 CegarLoopResult]: At program point L1628-32(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,849 INFO L258 CegarLoopResult]: At program point L1628-34(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,850 INFO L258 CegarLoopResult]: At program point L1628-38(lines 1 1630) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (= ~s~0 ~NP~0))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= 0 .cse0) (<= .cse0 0) (or .cse1 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~myStatus~0 0) (or (= ~MPR3~0 ~s~0) .cse1) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,850 INFO L258 CegarLoopResult]: At program point L1628-41(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,850 INFO L258 CegarLoopResult]: At program point L1628-43(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,850 INFO L258 CegarLoopResult]: At program point L1628-44(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,851 INFO L258 CegarLoopResult]: At program point L1628-46(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,851 INFO L258 CegarLoopResult]: At program point L1628-47(lines 1 1630) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,851 INFO L258 CegarLoopResult]: At program point L1628-49(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~SKIP2~0 ~s~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,851 INFO L265 CegarLoopResult]: At program point L837(lines 667 839) the Hoare annotation is: true [2021-10-11 02:23:27,852 INFO L258 CegarLoopResult]: At program point L707(lines 701 838) the Hoare annotation is: (let ((.cse17 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse18 (<= ULTIMATE.start_main_~status~1 258)) (.cse14 (= ~pended~0 1)) (.cse15 (= ~compRegistered~0 0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (.cse8 (<= 4 ~SKIP2~0)) (.cse9 (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1))) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse11 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (not (= ~IPC~0 2))) (.cse7 (= ~NP~0 1)) (.cse1 (= ~pended~0 0)) (.cse16 (= ~s~0 ~DC~0)) (.cse12 (not (= ~MPR3~0 1))) (.cse4 (= 2 ~DC~0)) (.cse13 (not (= ~SKIP2~0 2))) (.cse5 (<= 3 ~SKIP1~0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|)) (and .cse6 .cse14 .cse15 (= ~s~0 ~NP~0) .cse4 .cse13) (and .cse0 .cse6 .cse7 .cse14 .cse15 .cse10 .cse12 .cse4 .cse13 .cse5) (and .cse6 .cse7 .cse1 .cse16 .cse17 (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse12 .cse4 .cse13) (and .cse1 .cse15 .cse16 (= ULTIMATE.start_main_~status~1 0)) (and .cse0 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (or (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|) (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258)) .cse4 .cse5 .cse6 .cse7 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse16 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse12 .cse13 (or (<= 260 ULTIMATE.start_main_~status~1) .cse18)) (and .cse6 .cse7 .cse1 .cse16 .cse17 .cse12 .cse4 .cse13 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0)) (and .cse0 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258) .cse1 .cse2 (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse16 .cse11 .cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 258) .cse13) (and .cse6 .cse14 .cse15 .cse16 .cse4 .cse13) (and .cse0 .cse1 .cse2 .cse3 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyDeviceControl_#res|) .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0) .cse6 .cse7 .cse1 .cse16 .cse12 .cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) .cse13 .cse5 (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0)))) [2021-10-11 02:23:27,852 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,852 INFO L262 CegarLoopResult]: For program point L1369(lines 1369 1536) no Hoare annotation was computed. [2021-10-11 02:23:27,852 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,852 INFO L258 CegarLoopResult]: At program point L974(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,853 INFO L258 CegarLoopResult]: At program point L974-1(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,853 INFO L258 CegarLoopResult]: At program point L974-2(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,853 INFO L258 CegarLoopResult]: At program point L974-3(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,853 INFO L258 CegarLoopResult]: At program point L974-4(lines 974 986) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,854 INFO L258 CegarLoopResult]: At program point L974-5(lines 974 986) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,854 INFO L258 CegarLoopResult]: At program point L974-6(lines 974 986) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,854 INFO L258 CegarLoopResult]: At program point L974-7(lines 974 986) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,854 INFO L258 CegarLoopResult]: At program point L974-8(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,855 INFO L258 CegarLoopResult]: At program point L974-9(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,855 INFO L258 CegarLoopResult]: At program point L974-10(lines 974 986) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~NP~0 1)) (.cse2 (<= (+ ~s~0 2) ~MPR1~0)) (.cse3 (= ~compRegistered~0 0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 (= ~pended~0 0) .cse1 .cse2 (<= 4 ~SKIP2~0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,855 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,855 INFO L258 CegarLoopResult]: At program point L974-11(lines 974 986) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~NP~0 1)) (.cse2 (<= (+ ~s~0 2) ~MPR1~0)) (.cse3 (= ~compRegistered~0 0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 (= ~pended~0 0) .cse1 .cse2 (<= 4 ~SKIP2~0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,856 INFO L258 CegarLoopResult]: At program point L974-12(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,856 INFO L258 CegarLoopResult]: At program point L974-13(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,856 INFO L258 CegarLoopResult]: At program point L974-14(lines 974 986) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~myStatus~0 0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,856 INFO L258 CegarLoopResult]: At program point L974-15(lines 974 986) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (= ~myStatus~0 0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,856 INFO L258 CegarLoopResult]: At program point L974-16(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,857 INFO L258 CegarLoopResult]: At program point L974-17(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,857 INFO L258 CegarLoopResult]: At program point L974-18(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,857 INFO L258 CegarLoopResult]: At program point L974-19(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,857 INFO L258 CegarLoopResult]: At program point L974-20(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,858 INFO L258 CegarLoopResult]: At program point L974-21(lines 974 986) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point L1376(lines 1376 1534) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point L319(lines 319 331) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point L980(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point L980-2(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,858 INFO L262 CegarLoopResult]: For program point L980-4(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-6(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-8(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-10(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-12(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-14(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-16(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-18(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,859 INFO L262 CegarLoopResult]: For program point L980-20(lines 980 984) no Hoare annotation was computed. [2021-10-11 02:23:27,860 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:23:27,860 INFO L262 CegarLoopResult]: For program point L324(lines 324 330) no Hoare annotation was computed. [2021-10-11 02:23:27,860 INFO L258 CegarLoopResult]: At program point L324-1(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~myStatus~0 0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,860 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,860 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,860 INFO L262 CegarLoopResult]: For program point L1383(lines 1383 1532) no Hoare annotation was computed. [2021-10-11 02:23:27,861 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,861 INFO L258 CegarLoopResult]: At program point L1384(lines 1376 1534) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (not (= ~SKIP2~0 2)) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,861 INFO L262 CegarLoopResult]: For program point L198(lines 198 206) no Hoare annotation was computed. [2021-10-11 02:23:27,861 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,861 INFO L258 CegarLoopResult]: At program point L730(lines 730 778) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,861 INFO L258 CegarLoopResult]: At program point L1526(lines 1401 1527) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~compRegistered~0 0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 2)))) (or (and (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse0 (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) .cse1 .cse2 (not (= ~MPR3~0 1)) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0) .cse3 .cse4 (<= 3 ~SKIP1~0)) (and .cse0 (= ~pended~0 1) .cse1 (= ~s~0 ~NP~0) .cse2 .cse3 .cse4))) [2021-10-11 02:23:27,862 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,862 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,862 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,862 INFO L258 CegarLoopResult]: At program point L735(lines 735 777) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,862 INFO L258 CegarLoopResult]: At program point L207(lines 207 426) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,863 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,863 INFO L262 CegarLoopResult]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-10-11 02:23:27,863 INFO L262 CegarLoopResult]: For program point L340-2(lines 340 345) no Hoare annotation was computed. [2021-10-11 02:23:27,863 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,863 INFO L262 CegarLoopResult]: For program point L210(lines 210 425) no Hoare annotation was computed. [2021-10-11 02:23:27,863 INFO L258 CegarLoopResult]: At program point L1400(lines 1390 1530) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,863 INFO L258 CegarLoopResult]: At program point L740(lines 740 776) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,864 INFO L262 CegarLoopResult]: For program point L213(lines 213 424) no Hoare annotation was computed. [2021-10-11 02:23:27,864 INFO L258 CegarLoopResult]: At program point L214(lines 210 425) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,864 INFO L262 CegarLoopResult]: For program point L216(lines 216 423) no Hoare annotation was computed. [2021-10-11 02:23:27,864 INFO L258 CegarLoopResult]: At program point L1009(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,864 INFO L258 CegarLoopResult]: At program point L1009-1(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,865 INFO L258 CegarLoopResult]: At program point L1009-2(lines 973 1037) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,865 INFO L258 CegarLoopResult]: At program point L1009-3(lines 973 1037) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,865 INFO L258 CegarLoopResult]: At program point L1009-4(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,865 INFO L258 CegarLoopResult]: At program point L1009-5(lines 973 1037) the Hoare annotation is: (let ((.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~NP~0 1)) (.cse2 (<= (+ ~s~0 2) ~MPR1~0)) (.cse3 (= ~compRegistered~0 0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= ~SKIP1~0 ~s~0)) (.cse6 (not (= ~MPR3~0 1))) (.cse7 (= 2 ~DC~0)) (.cse8 (<= 3 ~SKIP1~0))) (or (and .cse0 (= ~pended~0 0) .cse1 .cse2 (<= 4 ~SKIP2~0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse6 .cse7 .cse8) (and .cse0 (= ~pended~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~SKIP2~0 2)) .cse8))) [2021-10-11 02:23:27,866 INFO L258 CegarLoopResult]: At program point L1009-6(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,866 INFO L258 CegarLoopResult]: At program point L1009-7(lines 973 1037) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ~setEventCalled~0 1) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= 0 .cse0) (<= .cse0 0) (or (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) (= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0)) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (= ~MPR1~0 ~s~0) (<= 4 ~SKIP2~0) (= ~myStatus~0 0) (not (= ~MPR3~0 1)))) [2021-10-11 02:23:27,866 INFO L258 CegarLoopResult]: At program point L745(lines 745 775) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,866 INFO L258 CegarLoopResult]: At program point L1009-8(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,866 INFO L258 CegarLoopResult]: At program point L1009-9(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,867 INFO L258 CegarLoopResult]: At program point L1009-10(lines 973 1037) the Hoare annotation is: (and (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,867 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,867 INFO L258 CegarLoopResult]: At program point L85(lines 707 779) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~s~0 1)) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~NP~0 1) (<= (+ ~s~0 2) ~MPR1~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (< ULTIMATE.start_main_~status~1 (+ ~lowerDriverReturn~0 1)) (not (= 2 ~s~0)) (= ~myStatus~0 0) (not (= ~MPR3~0 1)) (not (= ~MPR3~0 ~s~0))) [2021-10-11 02:23:27,867 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,867 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:23:27,867 INFO L262 CegarLoopResult]: For program point L1275(lines 1275 1287) no Hoare annotation was computed. [2021-10-11 02:23:27,868 INFO L262 CegarLoopResult]: For program point L1275-2(lines 1274 1563) no Hoare annotation was computed. [2021-10-11 02:23:27,868 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,868 INFO L262 CegarLoopResult]: For program point L219(lines 219 422) no Hoare annotation was computed. [2021-10-11 02:23:27,868 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,868 INFO L258 CegarLoopResult]: At program point L220(lines 216 423) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,868 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L258 CegarLoopResult]: At program point L222(lines 222 421) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1280(lines 1280 1285) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-1(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-2(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-3(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-4(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-5(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,869 INFO L262 CegarLoopResult]: For program point L1017-6(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L1017-7(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L1017-8(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L1017-9(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L1017-10(lines 1017 1034) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L258 CegarLoopResult]: At program point L225(lines 225 420) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L491(lines 491 503) no Hoare annotation was computed. [2021-10-11 02:23:27,870 INFO L262 CegarLoopResult]: For program point L360(lines 360 366) no Hoare annotation was computed. [2021-10-11 02:23:27,871 INFO L258 CegarLoopResult]: At program point L228(lines 227 420) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~IPC~0 2)) (= ~pended~0 0) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 1)) (= 2 ~DC~0) (<= 3 ~SKIP1~0)) [2021-10-11 02:23:27,871 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,871 INFO L262 CegarLoopResult]: For program point L627(lines 627 629) no Hoare annotation was computed. [2021-10-11 02:23:27,871 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,871 INFO L262 CegarLoopResult]: For program point L496(lines 496 502) no Hoare annotation was computed. [2021-10-11 02:23:27,871 INFO L258 CegarLoopResult]: At program point L496-1(lines 1 1630) the Hoare annotation is: (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (= ULTIMATE.start_main_~status~1 0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ~compRegistered~0 1) (= 2 ~DC~0) (<= 3 ~SKIP1~0) (= ~customIrp~0 0) (not (= ~IPC~0 2)) (= ~s~0 1) (= ~NP~0 1) (<= 4 ~SKIP2~0) (or (= (+ ~myStatus~0 1073741637) 0) (= ~myStatus~0 0)) (not (= ~MPR3~0 1))) [2021-10-11 02:23:27,871 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,872 INFO L262 CegarLoopResult]: For program point L1554(lines 1554 1560) no Hoare annotation was computed. [2021-10-11 02:23:27,872 INFO L258 CegarLoopResult]: At program point L1554-1(lines 1554 1560) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~DC~0)) (.cse0 (not (= ~IPC~0 2))) (.cse1 (= ~pended~0 1)) (.cse2 (= ~compRegistered~0 0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse5 (= 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 2)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~pended~0 0) (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse4 .cse5 (<= 3 ~SKIP1~0) .cse0 (= ~NP~0 1) .cse2 .cse3 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) (not (= ~MPR3~0 1)) .cse6) (and .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse4 .cse5 .cse6))) [2021-10-11 02:23:27,872 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1627) no Hoare annotation was computed. [2021-10-11 02:23:27,872 INFO L262 CegarLoopResult]: For program point L1026(lines 1026 1033) no Hoare annotation was computed. [2021-10-11 02:23:27,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:27 BoogieIcfgContainer [2021-10-11 02:23:27,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:27,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:27,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:27,962 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:27,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:22:59" (3/4) ... [2021-10-11 02:23:27,966 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:23:28,003 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 281 nodes and edges [2021-10-11 02:23:28,008 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2021-10-11 02:23:28,014 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-11 02:23:28,019 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-11 02:23:28,049 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && 2 == DC) && !(SKIP2 == 2))) || (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && compRegistered == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2))) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || ((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && pended == 0) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) [2021-10-11 02:23:28,050 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && compRegistered == 0) && SKIP2 == s) && !(s == 1)) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || ((((((((!(IPC == 2) && pended == 0) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result)) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || ((((((((!(IPC == 2) && pended == 0) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2))) || ((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && pended == 0) && NP == 1) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) [2021-10-11 02:23:28,050 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((((((SKIP1 + 2 <= MPR1 && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || (((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result)) || ((((!(IPC == 2) && pended == 1) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && SKIP2 == s) && !(s == 1)) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) [2021-10-11 02:23:28,051 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((((((SKIP1 + 2 <= MPR1 && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || (((((((((((((SKIP1 + 2 <= MPR1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && !(2 == s)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && s == DC) && !(MPR3 == 1)) && status + 1073741536 <= 0) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((!(IPC == 2) && pended == 1) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((SKIP1 + 2 <= MPR1 && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && !(2 == s)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && lowerDriverReturn <= \result)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) [2021-10-11 02:23:28,055 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status == 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((((((!(IPC == 2) && pended == 1) && !(259 == __cil_tmp29)) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2))) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && NP == 1) && compRegistered == 0) && status == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && lowerDriverReturn <= \result) [2021-10-11 02:23:28,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == s)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == s)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,061 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && compRegistered == 0) && 4 <= SKIP2) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,063 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) [2021-10-11 02:23:28,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && NP == 1) && compRegistered == 0) && status == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && \result + 1 <= 0) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) [2021-10-11 02:23:28,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2)) || ((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2))) || (((((((((!(IPC == 2) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && status == 0) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && compRegistered == 0) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) [2021-10-11 02:23:28,068 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2)) [2021-10-11 02:23:28,069 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result + 1073741670 <= 0) || (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) [2021-10-11 02:23:28,069 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) [2021-10-11 02:23:28,069 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) [2021-10-11 02:23:28,070 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) [2021-10-11 02:23:28,070 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus <= 0)) || (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) [2021-10-11 02:23:28,070 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) [2021-10-11 02:23:28,070 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus <= 0)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) [2021-10-11 02:23:28,245 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_125196bd-8496-46dc-b96a-b774107b772d/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:28,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:28,246 INFO L168 Benchmark]: Toolchain (without parser) took 32498.57 ms. Allocated memory was 123.7 MB in the beginning and 526.4 MB in the end (delta: 402.7 MB). Free memory was 83.1 MB in the beginning and 404.4 MB in the end (delta: -321.3 MB). Peak memory consumption was 79.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,247 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 123.7 MB. Free memory is still 100.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:28,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.95 ms. Allocated memory is still 123.7 MB. Free memory was 82.9 MB in the beginning and 83.5 MB in the end (delta: -600.2 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 177.62 ms. Allocated memory is still 123.7 MB. Free memory was 83.1 MB in the beginning and 72.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,248 INFO L168 Benchmark]: Boogie Preprocessor took 132.29 ms. Allocated memory is still 123.7 MB. Free memory was 72.6 MB in the beginning and 65.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,248 INFO L168 Benchmark]: RCFGBuilder took 3175.26 ms. Allocated memory was 123.7 MB in the beginning and 228.6 MB in the end (delta: 104.9 MB). Free memory was 65.9 MB in the beginning and 105.9 MB in the end (delta: -40.0 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,249 INFO L168 Benchmark]: TraceAbstraction took 28105.22 ms. Allocated memory was 228.6 MB in the beginning and 526.4 MB in the end (delta: 297.8 MB). Free memory was 104.9 MB in the beginning and 450.5 MB in the end (delta: -345.6 MB). Peak memory consumption was 239.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,249 INFO L168 Benchmark]: Witness Printer took 284.15 ms. Allocated memory is still 526.4 MB. Free memory was 450.5 MB in the beginning and 404.4 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:28,251 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.28 ms. Allocated memory is still 123.7 MB. Free memory is still 100.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 613.95 ms. Allocated memory is still 123.7 MB. Free memory was 82.9 MB in the beginning and 83.5 MB in the end (delta: -600.2 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 177.62 ms. Allocated memory is still 123.7 MB. Free memory was 83.1 MB in the beginning and 72.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 132.29 ms. Allocated memory is still 123.7 MB. Free memory was 72.6 MB in the beginning and 65.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3175.26 ms. Allocated memory was 123.7 MB in the beginning and 228.6 MB in the end (delta: 104.9 MB). Free memory was 65.9 MB in the beginning and 105.9 MB in the end (delta: -40.0 MB). Peak memory consumption was 68.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28105.22 ms. Allocated memory was 228.6 MB in the beginning and 526.4 MB in the end (delta: 297.8 MB). Free memory was 104.9 MB in the beginning and 450.5 MB in the end (delta: -345.6 MB). Peak memory consumption was 239.5 MB. Max. memory is 16.1 GB. * Witness Printer took 284.15 ms. Allocated memory is still 526.4 MB. Free memory was 450.5 MB in the beginning and 404.4 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1627]: 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 53 specifications checked. All of them hold - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1390]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && (s == NP || 259 <= returnVal2)) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && (MPR3 == s || !(259 == returnVal2)) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: (((((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((((((SKIP1 + 2 <= MPR1 && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || (((((((((((((SKIP1 + 2 <= MPR1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && !(2 == s)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && s == DC) && !(MPR3 == 1)) && status + 1073741536 <= 0) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((!(IPC == 2) && pended == 1) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((SKIP1 + 2 <= MPR1 && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && 2 == DC) && lowerDriverReturn <= status) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && !(2 == s)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && lowerDriverReturn <= \result)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && myStatus == 0) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1554]: Loop Invariant Derived loop invariant: (((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2)) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && status == 0) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && compRegistered == 0) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2))) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2)) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((((!(IPC == 2) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status == 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((((((!(IPC == 2) && pended == 1) && !(259 == __cil_tmp29)) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2))) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && NP == 1) && compRegistered == 0) && status == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && lowerDriverReturn <= \result) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2) - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((((!(IPC == 2) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((pended == 0 && compRegistered == 0) && s == DC) && status == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((pended == 0 && compRegistered == 0) && s == DC) && status == 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((!(IPC == 2) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1 - InvariantResult [Line: 1183]: Loop Invariant Derived loop invariant: ((((((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2)) || ((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2))) || (((((((((!(IPC == 2) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && status == 0) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && compRegistered == 0) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) - InvariantResult [Line: 1401]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && ntStatus <= 0) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 724]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && s == NP) && status == 0) && (returnVal2 == 0 || returnVal2 + 1073741823 == 0)) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == s)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == s)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 730]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 1066]: Loop Invariant Derived loop invariant: ((((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && s == NP) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && lowerDriverReturn <= ntStatus) && 4 <= SKIP2) && ntStatus <= lowerDriverReturn) && myStatus == 0) && (ntStatus <= 258 || 259 == __cil_tmp30)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2)) || ((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && pended == 0) && compRegistered == 0) && s == DC) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(SKIP2 == 2)) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && (259 == __cil_tmp11 || ntStatus <= 258)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && compRegistered == 1) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && compRegistered == 0) && 4 <= SKIP2) && status == 0) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && compRegistered == 1) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && lowerDriverReturn <= ntStatus) && 4 <= SKIP2) && ntStatus <= lowerDriverReturn) && (ntStatus <= 258 || 259 == __cil_tmp30)) && myStatus == 0) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result + 1073741670 <= 0) || (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus <= 0)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && ntStatus <= 258) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && compRegistered == 1) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && myStatus == 0) && !(MPR3 == 1) - InvariantResult [Line: 735]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && myStatus == 0) && !(MPR3 == 1) - InvariantResult [Line: 1321]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && compRegistered == 0) && SKIP2 == s) && !(s == 1)) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && s == DC) && (ntStatus <= 258 || 260 <= ntStatus)) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || ((((((((!(IPC == 2) && pended == 0) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result)) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || ((((((((!(IPC == 2) && pended == 0) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2))) || ((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && pended == 0) && NP == 1) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && MPR1 == s) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 740]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && \result <= 258) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == NP) && 2 == DC) && !(SKIP2 == 2))) || (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && compRegistered == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || ((((((((!(IPC == 2) && NP == 1) && pended == 0) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || (((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2))) || (((((!(IPC == 2) && pended == 1) && compRegistered == 0) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || ((((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && pended == 0) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 0) && 4 <= SKIP2) && s == DC) && status == 0) && ntStatus + 1073741823 == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || (((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || (((((((!(IPC == 2) && pended == 1) && !(259 == __cil_tmp29)) && compRegistered == 0) && s == DC) && status == 0) && 2 == DC) && !(SKIP2 == 2))) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && lowerDriverReturn <= ntStatus) && 4 <= SKIP2) && SKIP2 == s) && ntStatus <= lowerDriverReturn) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1))) || ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && NP == 1) && compRegistered == 0) && status == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && (s == NP || 259 <= returnVal2)) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && myStatus == 0) && (MPR3 == s || s == NP)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 974]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && !(s == 1)) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status < lowerDriverReturn + 1) && !(2 == s)) && myStatus == 0) && !(MPR3 == 1)) && !(MPR3 == s) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && NP == 1) && compRegistered == 0) && status == 0) && SKIP2 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) || (((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && \result + 1 <= 0) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1376]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && returnVal2 <= lowerDriverReturn) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && 2 == DC) && status <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && s == DC) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && \result <= 258) && !(SKIP2 == 2)) || ((((((((((((SKIP1 + 2 <= MPR1 && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && (260 <= \result || \result <= 258)) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && (ntStatus <= 258 || 260 <= ntStatus)) && s == DC) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && !(MPR3 == 1)) && !(SKIP2 == 2)) && (260 <= status || status <= 258))) || (((((((((ntStatus + 1073741536 <= 0 && !(IPC == 2)) && NP == 1) && s == DC) && !(MPR3 == 1)) && 2 == DC) && status + 1073741536 <= 0) && !(SKIP2 == 2)) && 3 <= SKIP1) && \result + 1073741536 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && lowerDriverReturn <= \result) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && \result <= lowerDriverReturn) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2))) || (((pended == 0 && compRegistered == 0) && s == DC) && status == 0)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && \result + 1073741738 <= 0)) || ((((((((((((((SKIP1 + 2 <= MPR1 && \result <= lowerDriverReturn) && returnVal2 <= lowerDriverReturn) && lowerDriverReturn <= status) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && status < lowerDriverReturn + 1) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && !(SKIP2 == 2)) && lowerDriverReturn <= \result)) || ((((!(IPC == 2) && pended == 1) && s == DC) && 2 == DC) && !(SKIP2 == 2))) || (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && NP == 1) && pended == 1) && SKIP2 == s) && !(s == 1)) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1)) || (((((((!(IPC == 2) && NP == 1) && s == DC) && status + 1073741738 <= 0) && \result + 1073741738 <= 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && SKIP2 == s) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && myStatus == 0) && !(MPR3 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 1) && s == 1) && NP == 1) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1 - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && \result + 1 <= 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1) || ((((((((((!(IPC == 2) && pended == 1) && NP == 1) && s + 2 <= MPR1) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && !(SKIP2 == 2)) && 3 <= SKIP1) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && 2 == DC) && 3 <= SKIP1) && customIrp == 0) && !(IPC == 2)) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && (myStatus + 1073741637 == 0 || myStatus == 0)) && !(MPR3 == 1) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && setEventCalled == 1) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && (s == NP || 259 <= returnVal2)) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 2 == DC) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 4 <= SKIP2) && (myStatus + 1073741637 == 0 || myStatus == 0)) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && (MPR3 == s || !(259 == returnVal2)) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((SKIP1 + 2 <= MPR1 && !(IPC == 2)) && pended == 0) && s == 1) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((((((((((SKIP1 + 2 <= MPR1 && ntStatus <= 258) && pended == 0) && status == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus + 1 <= 0) || (((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && 4 <= SKIP2) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) && ntStatus <= 0)) || (((((((((((((((((((SKIP1 + 2 <= MPR1 && pended == 0) && status == 0) && ntStatus == 0) && returnVal2 <= lowerDriverReturn) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && ((259 == returnVal2 || returnVal2 == 0) || returnVal2 + 1073741823 == 0)) && compRegistered == 1) && ntStatus <= 258) && 3 <= SKIP1) && !(IPC == 2)) && NP == 1) && 2 == s) && s == DC) && \result <= 258) && 4 <= SKIP2) && ntStatus <= 258) && lowerDriverReturn <= returnVal2) && !(MPR3 == 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((!(IPC == 2) && pended == 0) && NP == 1) && s + 2 <= MPR1) && 4 <= SKIP2) && compRegistered == 0) && status == 0) && SKIP1 == s) && !(MPR3 == 1)) && 2 == DC) && 3 <= SKIP1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 351 locations, 53 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.8s, OverallIterations: 45, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11087 SDtfs, 7767 SDslu, 13688 SDs, 0 SdLazy, 3171 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 697 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 335 NumberOfFragments, 8334 HoareAnnotationTreeSize, 114 FomulaSimplifications, 9238630 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 114 FomulaSimplificationsInter, 449796 FormulaSimplificationTreeSizeReductionInter, 13.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1209 ConstructedInterpolants, 0 QuantifiedInterpolants, 108907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 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...