./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ad17193196daf327eee34f8d3cbf6704a80a533 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:11:15,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:11:15,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:11:15,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:11:15,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:11:15,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:11:15,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:11:15,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:11:15,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:11:15,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:11:15,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:11:15,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:11:15,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:11:15,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:11:15,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:11:15,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:11:15,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:11:15,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:11:15,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:11:15,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:11:15,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:11:15,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:11:15,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:11:15,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:11:15,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:11:15,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:11:15,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:11:15,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:11:15,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:11:15,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:11:15,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:11:15,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:11:15,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:11:15,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:11:15,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:11:15,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:11:15,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:11:15,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:11:15,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:11:15,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:11:15,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:11:15,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:11:15,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:11:15,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:11:15,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:11:15,188 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:11:15,188 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:11:15,188 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:11:15,188 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:11:15,188 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:11:15,188 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:11:15,189 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:11:15,189 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:11:15,189 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:11:15,189 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:11:15,189 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:11:15,189 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:11:15,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:11:15,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:11:15,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:11:15,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:11:15,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:11:15,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:11:15,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:11:15,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:11:15,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:11:15,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:11:15,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:11:15,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:11:15,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:11:15,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:11:15,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:11:15,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:11:15,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:11:15,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:11:15,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:11:15,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:11:15,194 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ad17193196daf327eee34f8d3cbf6704a80a533 [2019-12-07 19:11:15,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:11:15,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:11:15,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:11:15,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:11:15,306 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:11:15,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-12-07 19:11:15,346 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/data/e5db02136/bf0621fd001e40fe94bc71c828cd04ed/FLAGe7efcfdc9 [2019-12-07 19:11:15,824 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:11:15,825 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-12-07 19:11:15,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/data/e5db02136/bf0621fd001e40fe94bc71c828cd04ed/FLAGe7efcfdc9 [2019-12-07 19:11:15,846 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/data/e5db02136/bf0621fd001e40fe94bc71c828cd04ed [2019-12-07 19:11:15,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:11:15,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:11:15,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:11:15,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:11:15,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:11:15,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:11:15" (1/1) ... [2019-12-07 19:11:15,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcb14cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:15, skipping insertion in model container [2019-12-07 19:11:15,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:11:15" (1/1) ... [2019-12-07 19:11:15,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:11:15,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:11:16,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:11:16,122 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:11:16,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:11:16,200 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:11:16,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16 WrapperNode [2019-12-07 19:11:16,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:11:16,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:11:16,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:11:16,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:11:16,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:11:16,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:11:16,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:11:16,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:11:16,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... [2019-12-07 19:11:16,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:11:16,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:11:16,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:11:16,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:11:16,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:11:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:11:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:11:16,547 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,560 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,565 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,568 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,569 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,569 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,571 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,575 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,577 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,579 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,580 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,581 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,583 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,585 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,586 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,586 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,588 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,589 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,590 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,590 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,591 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,593 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,595 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,597 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,598 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,599 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,601 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,602 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,603 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:16,604 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:11:17,348 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-12-07 19:11:17,348 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-12-07 19:11:17,348 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-12-07 19:11:17,349 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-12-07 19:11:17,350 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-12-07 19:11:17,351 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-12-07 19:11:17,352 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-12-07 19:11:17,353 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-12-07 19:11:17,354 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-12-07 19:11:17,355 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-12-07 19:11:17,356 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-12-07 19:11:18,021 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:11:18,021 INFO L287 CfgBuilder]: Removed 275 assume(true) statements. [2019-12-07 19:11:18,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:11:18 BoogieIcfgContainer [2019-12-07 19:11:18,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:11:18,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:11:18,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:11:18,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:11:18,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:11:15" (1/3) ... [2019-12-07 19:11:18,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87dafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:11:18, skipping insertion in model container [2019-12-07 19:11:18,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:11:16" (2/3) ... [2019-12-07 19:11:18,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87dafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:11:18, skipping insertion in model container [2019-12-07 19:11:18,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:11:18" (3/3) ... [2019-12-07 19:11:18,027 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-12-07 19:11:18,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:11:18,038 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-12-07 19:11:18,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-12-07 19:11:18,063 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:11:18,063 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:11:18,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:11:18,063 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:11:18,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:11:18,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:11:18,064 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:11:18,064 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:11:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2019-12-07 19:11:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:11:18,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,091 INFO L410 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]=== [2019-12-07 19:11:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash -286077311, now seen corresponding path program 1 times [2019-12-07 19:11:18,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924996457] [2019-12-07 19:11:18,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924996457] [2019-12-07 19:11:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342383997] [2019-12-07 19:11:18,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,232 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2019-12-07 19:11:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,416 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2019-12-07 19:11:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 19:11:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,428 INFO L225 Difference]: With dead ends: 637 [2019-12-07 19:11:18,428 INFO L226 Difference]: Without dead ends: 359 [2019-12-07 19:11:18,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-07 19:11:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2019-12-07 19:11:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 19:11:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 464 transitions. [2019-12-07 19:11:18,475 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 464 transitions. Word has length 6 [2019-12-07 19:11:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,475 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 464 transitions. [2019-12-07 19:11:18,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 464 transitions. [2019-12-07 19:11:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:11:18,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,476 INFO L410 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]=== [2019-12-07 19:11:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 383646239, now seen corresponding path program 1 times [2019-12-07 19:11:18,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203747805] [2019-12-07 19:11:18,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203747805] [2019-12-07 19:11:18,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:11:18,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807003760] [2019-12-07 19:11:18,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,497 INFO L87 Difference]: Start difference. First operand 342 states and 464 transitions. Second operand 3 states. [2019-12-07 19:11:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,518 INFO L93 Difference]: Finished difference Result 378 states and 507 transitions. [2019-12-07 19:11:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 19:11:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,520 INFO L225 Difference]: With dead ends: 378 [2019-12-07 19:11:18,520 INFO L226 Difference]: Without dead ends: 359 [2019-12-07 19:11:18,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-07 19:11:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2019-12-07 19:11:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 19:11:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2019-12-07 19:11:18,537 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 10 [2019-12-07 19:11:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,537 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2019-12-07 19:11:18,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2019-12-07 19:11:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:11:18,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,538 INFO L410 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]=== [2019-12-07 19:11:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1848249011, now seen corresponding path program 1 times [2019-12-07 19:11:18,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375379033] [2019-12-07 19:11:18,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375379033] [2019-12-07 19:11:18,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022459180] [2019-12-07 19:11:18,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,586 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 3 states. [2019-12-07 19:11:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,609 INFO L93 Difference]: Finished difference Result 412 states and 547 transitions. [2019-12-07 19:11:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 19:11:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,611 INFO L225 Difference]: With dead ends: 412 [2019-12-07 19:11:18,611 INFO L226 Difference]: Without dead ends: 388 [2019-12-07 19:11:18,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-12-07 19:11:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 364. [2019-12-07 19:11:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-07 19:11:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 497 transitions. [2019-12-07 19:11:18,625 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 497 transitions. Word has length 11 [2019-12-07 19:11:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,626 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 497 transitions. [2019-12-07 19:11:18,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 497 transitions. [2019-12-07 19:11:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:11:18,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,641 INFO L410 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]=== [2019-12-07 19:11:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -98212966, now seen corresponding path program 1 times [2019-12-07 19:11:18,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473410638] [2019-12-07 19:11:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473410638] [2019-12-07 19:11:18,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595722182] [2019-12-07 19:11:18,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,687 INFO L87 Difference]: Start difference. First operand 364 states and 497 transitions. Second operand 3 states. [2019-12-07 19:11:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,730 INFO L93 Difference]: Finished difference Result 602 states and 804 transitions. [2019-12-07 19:11:18,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 19:11:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,733 INFO L225 Difference]: With dead ends: 602 [2019-12-07 19:11:18,733 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 19:11:18,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 19:11:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 342. [2019-12-07 19:11:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 19:11:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2019-12-07 19:11:18,744 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 12 [2019-12-07 19:11:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,744 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2019-12-07 19:11:18,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2019-12-07 19:11:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:11:18,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,746 INFO L410 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]=== [2019-12-07 19:11:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1804879722, now seen corresponding path program 1 times [2019-12-07 19:11:18,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347460215] [2019-12-07 19:11:18,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347460215] [2019-12-07 19:11:18,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395098887] [2019-12-07 19:11:18,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,767 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 3 states. [2019-12-07 19:11:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,862 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2019-12-07 19:11:18,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:11:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,864 INFO L225 Difference]: With dead ends: 366 [2019-12-07 19:11:18,864 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 19:11:18,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 19:11:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-12-07 19:11:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 19:11:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 486 transitions. [2019-12-07 19:11:18,880 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 486 transitions. Word has length 14 [2019-12-07 19:11:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,880 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 486 transitions. [2019-12-07 19:11:18,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2019-12-07 19:11:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:11:18,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,882 INFO L410 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]=== [2019-12-07 19:11:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 134153172, now seen corresponding path program 1 times [2019-12-07 19:11:18,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677616409] [2019-12-07 19:11:18,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677616409] [2019-12-07 19:11:18,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516255824] [2019-12-07 19:11:18,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,912 INFO L87 Difference]: Start difference. First operand 361 states and 486 transitions. Second operand 3 states. [2019-12-07 19:11:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:18,931 INFO L93 Difference]: Finished difference Result 373 states and 499 transitions. [2019-12-07 19:11:18,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:18,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 19:11:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:18,932 INFO L225 Difference]: With dead ends: 373 [2019-12-07 19:11:18,932 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 19:11:18,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 19:11:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2019-12-07 19:11:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-07 19:11:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2019-12-07 19:11:18,943 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 15 [2019-12-07 19:11:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:18,943 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2019-12-07 19:11:18,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2019-12-07 19:11:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:11:18,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:18,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:18,945 INFO L410 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]=== [2019-12-07 19:11:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1662770972, now seen corresponding path program 1 times [2019-12-07 19:11:18,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:18,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531836349] [2019-12-07 19:11:18,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:18,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531836349] [2019-12-07 19:11:18,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:18,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:18,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722762222] [2019-12-07 19:11:18,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:18,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:18,970 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand 3 states. [2019-12-07 19:11:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,075 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2019-12-07 19:11:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:19,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 19:11:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,076 INFO L225 Difference]: With dead ends: 357 [2019-12-07 19:11:19,077 INFO L226 Difference]: Without dead ends: 341 [2019-12-07 19:11:19,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-07 19:11:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2019-12-07 19:11:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-07 19:11:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2019-12-07 19:11:19,087 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 17 [2019-12-07 19:11:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,087 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2019-12-07 19:11:19,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2019-12-07 19:11:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:11:19,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,088 INFO L410 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]=== [2019-12-07 19:11:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -36105606, now seen corresponding path program 1 times [2019-12-07 19:11:19,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931867278] [2019-12-07 19:11:19,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931867278] [2019-12-07 19:11:19,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:19,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242585439] [2019-12-07 19:11:19,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:19,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,107 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand 3 states. [2019-12-07 19:11:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,221 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2019-12-07 19:11:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:19,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:11:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,223 INFO L225 Difference]: With dead ends: 421 [2019-12-07 19:11:19,223 INFO L226 Difference]: Without dead ends: 413 [2019-12-07 19:11:19,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-07 19:11:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2019-12-07 19:11:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 19:11:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 481 transitions. [2019-12-07 19:11:19,233 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 481 transitions. Word has length 19 [2019-12-07 19:11:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,233 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 481 transitions. [2019-12-07 19:11:19,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 481 transitions. [2019-12-07 19:11:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:11:19,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,234 INFO L410 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]=== [2019-12-07 19:11:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1126931719, now seen corresponding path program 1 times [2019-12-07 19:11:19,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183144158] [2019-12-07 19:11:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183144158] [2019-12-07 19:11:19,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:19,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831793031] [2019-12-07 19:11:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:11:19,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:11:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:11:19,279 INFO L87 Difference]: Start difference. First operand 353 states and 481 transitions. Second operand 7 states. [2019-12-07 19:11:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,626 INFO L93 Difference]: Finished difference Result 453 states and 595 transitions. [2019-12-07 19:11:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:19,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 19:11:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,628 INFO L225 Difference]: With dead ends: 453 [2019-12-07 19:11:19,628 INFO L226 Difference]: Without dead ends: 400 [2019-12-07 19:11:19,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:11:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-07 19:11:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 345. [2019-12-07 19:11:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 19:11:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 466 transitions. [2019-12-07 19:11:19,645 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 466 transitions. Word has length 20 [2019-12-07 19:11:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,645 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 466 transitions. [2019-12-07 19:11:19,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:11:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 466 transitions. [2019-12-07 19:11:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:11:19,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,647 INFO L410 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]=== [2019-12-07 19:11:19,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1826034508, now seen corresponding path program 1 times [2019-12-07 19:11:19,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990632916] [2019-12-07 19:11:19,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990632916] [2019-12-07 19:11:19,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:19,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671356185] [2019-12-07 19:11:19,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:19,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:19,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,679 INFO L87 Difference]: Start difference. First operand 345 states and 466 transitions. Second operand 3 states. [2019-12-07 19:11:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,780 INFO L93 Difference]: Finished difference Result 451 states and 608 transitions. [2019-12-07 19:11:19,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:19,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:11:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,782 INFO L225 Difference]: With dead ends: 451 [2019-12-07 19:11:19,782 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 19:11:19,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 19:11:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-12-07 19:11:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 19:11:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 462 transitions. [2019-12-07 19:11:19,794 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 462 transitions. Word has length 20 [2019-12-07 19:11:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,795 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 462 transitions. [2019-12-07 19:11:19,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 462 transitions. [2019-12-07 19:11:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:11:19,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,796 INFO L410 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]=== [2019-12-07 19:11:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1680674973, now seen corresponding path program 1 times [2019-12-07 19:11:19,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259830229] [2019-12-07 19:11:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259830229] [2019-12-07 19:11:19,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:19,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869538770] [2019-12-07 19:11:19,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:19,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:19,816 INFO L87 Difference]: Start difference. First operand 342 states and 462 transitions. Second operand 4 states. [2019-12-07 19:11:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,851 INFO L93 Difference]: Finished difference Result 355 states and 476 transitions. [2019-12-07 19:11:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:19,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 19:11:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,868 INFO L225 Difference]: With dead ends: 355 [2019-12-07 19:11:19,868 INFO L226 Difference]: Without dead ends: 340 [2019-12-07 19:11:19,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-07 19:11:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-12-07 19:11:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 19:11:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2019-12-07 19:11:19,878 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 20 [2019-12-07 19:11:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,878 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2019-12-07 19:11:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2019-12-07 19:11:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:11:19,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,879 INFO L410 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]=== [2019-12-07 19:11:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 670007894, now seen corresponding path program 1 times [2019-12-07 19:11:19,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185314701] [2019-12-07 19:11:19,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185314701] [2019-12-07 19:11:19,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:19,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37744760] [2019-12-07 19:11:19,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:19,901 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 4 states. [2019-12-07 19:11:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,932 INFO L93 Difference]: Finished difference Result 353 states and 473 transitions. [2019-12-07 19:11:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:19,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 19:11:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,934 INFO L225 Difference]: With dead ends: 353 [2019-12-07 19:11:19,934 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 19:11:19,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 19:11:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2019-12-07 19:11:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-12-07 19:11:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 456 transitions. [2019-12-07 19:11:19,948 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 456 transitions. Word has length 20 [2019-12-07 19:11:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,948 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 456 transitions. [2019-12-07 19:11:19,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 456 transitions. [2019-12-07 19:11:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:11:19,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:19,949 INFO L410 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]=== [2019-12-07 19:11:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -669854996, now seen corresponding path program 1 times [2019-12-07 19:11:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422946937] [2019-12-07 19:11:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:19,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422946937] [2019-12-07 19:11:19,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:19,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:19,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058231414] [2019-12-07 19:11:19,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:19,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,967 INFO L87 Difference]: Start difference. First operand 338 states and 456 transitions. Second operand 3 states. [2019-12-07 19:11:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:19,984 INFO L93 Difference]: Finished difference Result 378 states and 505 transitions. [2019-12-07 19:11:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:19,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 19:11:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:19,986 INFO L225 Difference]: With dead ends: 378 [2019-12-07 19:11:19,986 INFO L226 Difference]: Without dead ends: 324 [2019-12-07 19:11:19,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-07 19:11:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-12-07 19:11:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 19:11:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 431 transitions. [2019-12-07 19:11:19,996 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 431 transitions. Word has length 21 [2019-12-07 19:11:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:19,996 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 431 transitions. [2019-12-07 19:11:19,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 431 transitions. [2019-12-07 19:11:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:11:19,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:19,996 INFO L410 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] [2019-12-07 19:11:19,997 INFO L410 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]=== [2019-12-07 19:11:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2046524504, now seen corresponding path program 1 times [2019-12-07 19:11:19,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:19,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677704339] [2019-12-07 19:11:19,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:20,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677704339] [2019-12-07 19:11:20,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:20,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:20,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991362223] [2019-12-07 19:11:20,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:20,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:20,014 INFO L87 Difference]: Start difference. First operand 322 states and 431 transitions. Second operand 3 states. [2019-12-07 19:11:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:20,040 INFO L93 Difference]: Finished difference Result 419 states and 551 transitions. [2019-12-07 19:11:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:20,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 19:11:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:20,042 INFO L225 Difference]: With dead ends: 419 [2019-12-07 19:11:20,042 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 19:11:20,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 19:11:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2019-12-07 19:11:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-12-07 19:11:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 401 transitions. [2019-12-07 19:11:20,056 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 401 transitions. Word has length 22 [2019-12-07 19:11:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:20,056 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 401 transitions. [2019-12-07 19:11:20,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 401 transitions. [2019-12-07 19:11:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:11:20,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:20,057 INFO L410 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] [2019-12-07 19:11:20,057 INFO L410 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]=== [2019-12-07 19:11:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1567103020, now seen corresponding path program 1 times [2019-12-07 19:11:20,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:20,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602382930] [2019-12-07 19:11:20,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:20,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602382930] [2019-12-07 19:11:20,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:20,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:20,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579135142] [2019-12-07 19:11:20,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:20,087 INFO L87 Difference]: Start difference. First operand 304 states and 401 transitions. Second operand 4 states. [2019-12-07 19:11:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:20,117 INFO L93 Difference]: Finished difference Result 342 states and 442 transitions. [2019-12-07 19:11:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:20,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 19:11:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:20,119 INFO L225 Difference]: With dead ends: 342 [2019-12-07 19:11:20,119 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 19:11:20,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 19:11:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 306. [2019-12-07 19:11:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-07 19:11:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 403 transitions. [2019-12-07 19:11:20,129 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 403 transitions. Word has length 22 [2019-12-07 19:11:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:20,129 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 403 transitions. [2019-12-07 19:11:20,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 403 transitions. [2019-12-07 19:11:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:11:20,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:20,130 INFO L410 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] [2019-12-07 19:11:20,130 INFO L410 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]=== [2019-12-07 19:11:20,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1425627767, now seen corresponding path program 1 times [2019-12-07 19:11:20,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:20,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108784375] [2019-12-07 19:11:20,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:20,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108784375] [2019-12-07 19:11:20,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:20,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:11:20,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97122499] [2019-12-07 19:11:20,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:11:20,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:11:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:11:20,179 INFO L87 Difference]: Start difference. First operand 306 states and 403 transitions. Second operand 8 states. [2019-12-07 19:11:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:20,499 INFO L93 Difference]: Finished difference Result 324 states and 421 transitions. [2019-12-07 19:11:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:20,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 19:11:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:20,501 INFO L225 Difference]: With dead ends: 324 [2019-12-07 19:11:20,501 INFO L226 Difference]: Without dead ends: 319 [2019-12-07 19:11:20,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:11:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-12-07 19:11:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2019-12-07 19:11:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-12-07 19:11:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 402 transitions. [2019-12-07 19:11:20,511 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 402 transitions. Word has length 22 [2019-12-07 19:11:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:20,511 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 402 transitions. [2019-12-07 19:11:20,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:11:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 402 transitions. [2019-12-07 19:11:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 19:11:20,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:20,512 INFO L410 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] [2019-12-07 19:11:20,512 INFO L410 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]=== [2019-12-07 19:11:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash -14574734, now seen corresponding path program 1 times [2019-12-07 19:11:20,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:20,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772557688] [2019-12-07 19:11:20,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:20,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772557688] [2019-12-07 19:11:20,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:20,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:20,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563798920] [2019-12-07 19:11:20,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:20,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:20,533 INFO L87 Difference]: Start difference. First operand 306 states and 402 transitions. Second operand 3 states. [2019-12-07 19:11:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:20,554 INFO L93 Difference]: Finished difference Result 423 states and 546 transitions. [2019-12-07 19:11:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:20,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 19:11:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:20,556 INFO L225 Difference]: With dead ends: 423 [2019-12-07 19:11:20,556 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 19:11:20,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 19:11:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 294. [2019-12-07 19:11:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 19:11:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 384 transitions. [2019-12-07 19:11:20,568 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 384 transitions. Word has length 23 [2019-12-07 19:11:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:20,568 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 384 transitions. [2019-12-07 19:11:20,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 384 transitions. [2019-12-07 19:11:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 19:11:20,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:20,569 INFO L410 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] [2019-12-07 19:11:20,569 INFO L410 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]=== [2019-12-07 19:11:20,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:20,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1774055580, now seen corresponding path program 1 times [2019-12-07 19:11:20,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:20,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079605468] [2019-12-07 19:11:20,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:20,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079605468] [2019-12-07 19:11:20,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:20,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:11:20,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523776485] [2019-12-07 19:11:20,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:11:20,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:11:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:11:20,613 INFO L87 Difference]: Start difference. First operand 294 states and 384 transitions. Second operand 8 states. [2019-12-07 19:11:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:20,909 INFO L93 Difference]: Finished difference Result 312 states and 401 transitions. [2019-12-07 19:11:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:20,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-07 19:11:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:20,910 INFO L225 Difference]: With dead ends: 312 [2019-12-07 19:11:20,910 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 19:11:20,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:11:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 19:11:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2019-12-07 19:11:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-07 19:11:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 383 transitions. [2019-12-07 19:11:20,921 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 383 transitions. Word has length 23 [2019-12-07 19:11:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:20,921 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 383 transitions. [2019-12-07 19:11:20,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:11:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 383 transitions. [2019-12-07 19:11:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:11:20,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:20,922 INFO L410 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] [2019-12-07 19:11:20,922 INFO L410 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]=== [2019-12-07 19:11:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash 520162629, now seen corresponding path program 1 times [2019-12-07 19:11:20,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:20,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207138323] [2019-12-07 19:11:20,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207138323] [2019-12-07 19:11:21,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:21,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064085552] [2019-12-07 19:11:21,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:21,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:21,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:21,021 INFO L87 Difference]: Start difference. First operand 294 states and 383 transitions. Second operand 3 states. [2019-12-07 19:11:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,062 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2019-12-07 19:11:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 19:11:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,064 INFO L225 Difference]: With dead ends: 394 [2019-12-07 19:11:21,064 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 19:11:21,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 19:11:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2019-12-07 19:11:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 19:11:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 365 transitions. [2019-12-07 19:11:21,076 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 365 transitions. Word has length 24 [2019-12-07 19:11:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,076 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 365 transitions. [2019-12-07 19:11:21,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 365 transitions. [2019-12-07 19:11:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:11:21,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,077 INFO L410 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] [2019-12-07 19:11:21,077 INFO L410 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]=== [2019-12-07 19:11:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1181802126, now seen corresponding path program 1 times [2019-12-07 19:11:21,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999850711] [2019-12-07 19:11:21,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999850711] [2019-12-07 19:11:21,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:21,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000208001] [2019-12-07 19:11:21,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:21,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:21,096 INFO L87 Difference]: Start difference. First operand 282 states and 365 transitions. Second operand 3 states. [2019-12-07 19:11:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,199 INFO L93 Difference]: Finished difference Result 373 states and 471 transitions. [2019-12-07 19:11:21,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:21,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 19:11:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,202 INFO L225 Difference]: With dead ends: 373 [2019-12-07 19:11:21,202 INFO L226 Difference]: Without dead ends: 353 [2019-12-07 19:11:21,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-12-07 19:11:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 299. [2019-12-07 19:11:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 19:11:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 382 transitions. [2019-12-07 19:11:21,221 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 382 transitions. Word has length 24 [2019-12-07 19:11:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,221 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 382 transitions. [2019-12-07 19:11:21,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 382 transitions. [2019-12-07 19:11:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:11:21,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,222 INFO L410 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] [2019-12-07 19:11:21,222 INFO L410 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]=== [2019-12-07 19:11:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 478588448, now seen corresponding path program 1 times [2019-12-07 19:11:21,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104577066] [2019-12-07 19:11:21,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104577066] [2019-12-07 19:11:21,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:21,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962222380] [2019-12-07 19:11:21,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:21,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:21,257 INFO L87 Difference]: Start difference. First operand 299 states and 382 transitions. Second operand 5 states. [2019-12-07 19:11:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,305 INFO L93 Difference]: Finished difference Result 312 states and 394 transitions. [2019-12-07 19:11:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:21,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 19:11:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,307 INFO L225 Difference]: With dead ends: 312 [2019-12-07 19:11:21,307 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 19:11:21,307 INFO L630 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 [2019-12-07 19:11:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 19:11:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-12-07 19:11:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-07 19:11:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 377 transitions. [2019-12-07 19:11:21,325 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 377 transitions. Word has length 24 [2019-12-07 19:11:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,325 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 377 transitions. [2019-12-07 19:11:21,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 377 transitions. [2019-12-07 19:11:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:11:21,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:21,326 INFO L410 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]=== [2019-12-07 19:11:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 903463757, now seen corresponding path program 1 times [2019-12-07 19:11:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475399090] [2019-12-07 19:11:21,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475399090] [2019-12-07 19:11:21,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:21,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603237250] [2019-12-07 19:11:21,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:21,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:21,357 INFO L87 Difference]: Start difference. First operand 295 states and 377 transitions. Second operand 4 states. [2019-12-07 19:11:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,474 INFO L93 Difference]: Finished difference Result 381 states and 484 transitions. [2019-12-07 19:11:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:21,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:11:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,476 INFO L225 Difference]: With dead ends: 381 [2019-12-07 19:11:21,476 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 19:11:21,477 INFO L630 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 [2019-12-07 19:11:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 19:11:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-12-07 19:11:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-07 19:11:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2019-12-07 19:11:21,495 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 25 [2019-12-07 19:11:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,495 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2019-12-07 19:11:21,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2019-12-07 19:11:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:11:21,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:21,496 INFO L410 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]=== [2019-12-07 19:11:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2001383120, now seen corresponding path program 1 times [2019-12-07 19:11:21,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330877936] [2019-12-07 19:11:21,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330877936] [2019-12-07 19:11:21,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:21,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874805688] [2019-12-07 19:11:21,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:21,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:21,532 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 5 states. [2019-12-07 19:11:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,718 INFO L93 Difference]: Finished difference Result 303 states and 381 transitions. [2019-12-07 19:11:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:21,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:11:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,720 INFO L225 Difference]: With dead ends: 303 [2019-12-07 19:11:21,720 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 19:11:21,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:11:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 19:11:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-12-07 19:11:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 19:11:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 376 transitions. [2019-12-07 19:11:21,734 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 376 transitions. Word has length 25 [2019-12-07 19:11:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,734 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 376 transitions. [2019-12-07 19:11:21,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 376 transitions. [2019-12-07 19:11:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:11:21,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:21,735 INFO L410 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]=== [2019-12-07 19:11:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2001371204, now seen corresponding path program 1 times [2019-12-07 19:11:21,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263547526] [2019-12-07 19:11:21,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263547526] [2019-12-07 19:11:21,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:21,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148715430] [2019-12-07 19:11:21,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:21,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:21,763 INFO L87 Difference]: Start difference. First operand 297 states and 376 transitions. Second operand 5 states. [2019-12-07 19:11:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:21,938 INFO L93 Difference]: Finished difference Result 305 states and 382 transitions. [2019-12-07 19:11:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:21,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:11:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:21,940 INFO L225 Difference]: With dead ends: 305 [2019-12-07 19:11:21,940 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 19:11:21,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:11:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 19:11:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-12-07 19:11:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 19:11:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 375 transitions. [2019-12-07 19:11:21,962 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 375 transitions. Word has length 25 [2019-12-07 19:11:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:21,962 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 375 transitions. [2019-12-07 19:11:21,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 375 transitions. [2019-12-07 19:11:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:11:21,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:21,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:21,964 INFO L410 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]=== [2019-12-07 19:11:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2110035990, now seen corresponding path program 1 times [2019-12-07 19:11:21,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:21,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041923756] [2019-12-07 19:11:21,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:21,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041923756] [2019-12-07 19:11:21,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:21,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:21,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752979352] [2019-12-07 19:11:21,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:21,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:21,994 INFO L87 Difference]: Start difference. First operand 297 states and 375 transitions. Second operand 4 states. [2019-12-07 19:11:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,110 INFO L93 Difference]: Finished difference Result 339 states and 418 transitions. [2019-12-07 19:11:22,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:22,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:11:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,112 INFO L225 Difference]: With dead ends: 339 [2019-12-07 19:11:22,112 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 19:11:22,112 INFO L630 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 [2019-12-07 19:11:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 19:11:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-12-07 19:11:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 19:11:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 366 transitions. [2019-12-07 19:11:22,132 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 366 transitions. Word has length 25 [2019-12-07 19:11:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 366 transitions. [2019-12-07 19:11:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 366 transitions. [2019-12-07 19:11:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:11:22,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:22,133 INFO L410 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] [2019-12-07 19:11:22,133 INFO L410 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]=== [2019-12-07 19:11:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1677586694, now seen corresponding path program 1 times [2019-12-07 19:11:22,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:22,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711200068] [2019-12-07 19:11:22,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:22,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711200068] [2019-12-07 19:11:22,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:22,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:22,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541858813] [2019-12-07 19:11:22,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:22,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:22,187 INFO L87 Difference]: Start difference. First operand 297 states and 366 transitions. Second operand 5 states. [2019-12-07 19:11:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,407 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2019-12-07 19:11:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:11:22,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 19:11:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,409 INFO L225 Difference]: With dead ends: 350 [2019-12-07 19:11:22,410 INFO L226 Difference]: Without dead ends: 346 [2019-12-07 19:11:22,410 INFO L630 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 [2019-12-07 19:11:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-07 19:11:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 297. [2019-12-07 19:11:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 19:11:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 366 transitions. [2019-12-07 19:11:22,433 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 366 transitions. Word has length 26 [2019-12-07 19:11:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:22,433 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 366 transitions. [2019-12-07 19:11:22,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 366 transitions. [2019-12-07 19:11:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:11:22,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:22,434 INFO L410 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] [2019-12-07 19:11:22,435 INFO L410 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]=== [2019-12-07 19:11:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1095312260, now seen corresponding path program 1 times [2019-12-07 19:11:22,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:22,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923643051] [2019-12-07 19:11:22,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:22,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923643051] [2019-12-07 19:11:22,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:22,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:22,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753457805] [2019-12-07 19:11:22,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:22,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:22,494 INFO L87 Difference]: Start difference. First operand 297 states and 366 transitions. Second operand 6 states. [2019-12-07 19:11:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,615 INFO L93 Difference]: Finished difference Result 329 states and 398 transitions. [2019-12-07 19:11:22,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:11:22,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 19:11:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,616 INFO L225 Difference]: With dead ends: 329 [2019-12-07 19:11:22,616 INFO L226 Difference]: Without dead ends: 311 [2019-12-07 19:11:22,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:11:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-12-07 19:11:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 291. [2019-12-07 19:11:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 19:11:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 349 transitions. [2019-12-07 19:11:22,641 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 349 transitions. Word has length 26 [2019-12-07 19:11:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:22,641 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 349 transitions. [2019-12-07 19:11:22,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 349 transitions. [2019-12-07 19:11:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:11:22,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:22,642 INFO L410 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] [2019-12-07 19:11:22,642 INFO L410 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]=== [2019-12-07 19:11:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1852376873, now seen corresponding path program 1 times [2019-12-07 19:11:22,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:22,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261669952] [2019-12-07 19:11:22,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:22,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261669952] [2019-12-07 19:11:22,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:22,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:22,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232909645] [2019-12-07 19:11:22,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:22,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:22,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:22,669 INFO L87 Difference]: Start difference. First operand 291 states and 349 transitions. Second operand 4 states. [2019-12-07 19:11:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,765 INFO L93 Difference]: Finished difference Result 294 states and 351 transitions. [2019-12-07 19:11:22,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:22,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 19:11:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,766 INFO L225 Difference]: With dead ends: 294 [2019-12-07 19:11:22,766 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 19:11:22,767 INFO L630 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 [2019-12-07 19:11:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 19:11:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-12-07 19:11:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-07 19:11:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 322 transitions. [2019-12-07 19:11:22,781 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 322 transitions. Word has length 26 [2019-12-07 19:11:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:22,781 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 322 transitions. [2019-12-07 19:11:22,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 322 transitions. [2019-12-07 19:11:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:11:22,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:22,782 INFO L410 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] [2019-12-07 19:11:22,782 INFO L410 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]=== [2019-12-07 19:11:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -799017805, now seen corresponding path program 1 times [2019-12-07 19:11:22,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:22,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016684106] [2019-12-07 19:11:22,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:22,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016684106] [2019-12-07 19:11:22,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:22,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:22,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87760223] [2019-12-07 19:11:22,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:22,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:22,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:22,798 INFO L87 Difference]: Start difference. First operand 272 states and 322 transitions. Second operand 3 states. [2019-12-07 19:11:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,872 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2019-12-07 19:11:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:22,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 19:11:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,873 INFO L225 Difference]: With dead ends: 300 [2019-12-07 19:11:22,873 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 19:11:22,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 19:11:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2019-12-07 19:11:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-07 19:11:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2019-12-07 19:11:22,887 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 26 [2019-12-07 19:11:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:22,887 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2019-12-07 19:11:22,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2019-12-07 19:11:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:11:22,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:22,888 INFO L410 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] [2019-12-07 19:11:22,888 INFO L410 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]=== [2019-12-07 19:11:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1017708459, now seen corresponding path program 1 times [2019-12-07 19:11:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:22,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069632176] [2019-12-07 19:11:22,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:22,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069632176] [2019-12-07 19:11:22,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:22,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:22,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253222768] [2019-12-07 19:11:22,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:22,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:22,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:22,908 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand 4 states. [2019-12-07 19:11:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:22,990 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2019-12-07 19:11:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:22,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 19:11:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:22,991 INFO L225 Difference]: With dead ends: 259 [2019-12-07 19:11:22,991 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 19:11:22,992 INFO L630 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 [2019-12-07 19:11:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 19:11:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2019-12-07 19:11:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 19:11:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 300 transitions. [2019-12-07 19:11:23,006 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 300 transitions. Word has length 27 [2019-12-07 19:11:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,006 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 300 transitions. [2019-12-07 19:11:23,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 300 transitions. [2019-12-07 19:11:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:11:23,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,007 INFO L410 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] [2019-12-07 19:11:23,007 INFO L410 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]=== [2019-12-07 19:11:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1017720375, now seen corresponding path program 1 times [2019-12-07 19:11:23,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496948559] [2019-12-07 19:11:23,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496948559] [2019-12-07 19:11:23,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434405569] [2019-12-07 19:11:23,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,042 INFO L87 Difference]: Start difference. First operand 253 states and 300 transitions. Second operand 5 states. [2019-12-07 19:11:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,136 INFO L93 Difference]: Finished difference Result 282 states and 326 transitions. [2019-12-07 19:11:23,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:11:23,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 19:11:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,138 INFO L225 Difference]: With dead ends: 282 [2019-12-07 19:11:23,138 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 19:11:23,138 INFO L630 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 [2019-12-07 19:11:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 19:11:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 234. [2019-12-07 19:11:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 19:11:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2019-12-07 19:11:23,151 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 27 [2019-12-07 19:11:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,151 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2019-12-07 19:11:23,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2019-12-07 19:11:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:11:23,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,152 INFO L410 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] [2019-12-07 19:11:23,152 INFO L410 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]=== [2019-12-07 19:11:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 475837642, now seen corresponding path program 1 times [2019-12-07 19:11:23,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506038439] [2019-12-07 19:11:23,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506038439] [2019-12-07 19:11:23,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21945382] [2019-12-07 19:11:23,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,182 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 5 states. [2019-12-07 19:11:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,313 INFO L93 Difference]: Finished difference Result 264 states and 313 transitions. [2019-12-07 19:11:23,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:23,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 19:11:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,314 INFO L225 Difference]: With dead ends: 264 [2019-12-07 19:11:23,314 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 19:11:23,315 INFO L630 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 [2019-12-07 19:11:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 19:11:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 234. [2019-12-07 19:11:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 19:11:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2019-12-07 19:11:23,329 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 28 [2019-12-07 19:11:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,329 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2019-12-07 19:11:23,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2019-12-07 19:11:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:11:23,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,330 INFO L410 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] [2019-12-07 19:11:23,330 INFO L410 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]=== [2019-12-07 19:11:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 936222207, now seen corresponding path program 1 times [2019-12-07 19:11:23,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81944626] [2019-12-07 19:11:23,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81944626] [2019-12-07 19:11:23,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875322239] [2019-12-07 19:11:23,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,354 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 5 states. [2019-12-07 19:11:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,405 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2019-12-07 19:11:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:23,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 19:11:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,406 INFO L225 Difference]: With dead ends: 248 [2019-12-07 19:11:23,406 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 19:11:23,407 INFO L630 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 [2019-12-07 19:11:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 19:11:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-12-07 19:11:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 19:11:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2019-12-07 19:11:23,420 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 29 [2019-12-07 19:11:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,420 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2019-12-07 19:11:23,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2019-12-07 19:11:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:11:23,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,421 INFO L410 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] [2019-12-07 19:11:23,422 INFO L410 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]=== [2019-12-07 19:11:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash 709739975, now seen corresponding path program 1 times [2019-12-07 19:11:23,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506415789] [2019-12-07 19:11:23,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506415789] [2019-12-07 19:11:23,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763040114] [2019-12-07 19:11:23,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,460 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand 5 states. [2019-12-07 19:11:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,504 INFO L93 Difference]: Finished difference Result 285 states and 330 transitions. [2019-12-07 19:11:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:23,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 19:11:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,505 INFO L225 Difference]: With dead ends: 285 [2019-12-07 19:11:23,505 INFO L226 Difference]: Without dead ends: 259 [2019-12-07 19:11:23,505 INFO L630 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 [2019-12-07 19:11:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-12-07 19:11:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 233. [2019-12-07 19:11:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 19:11:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2019-12-07 19:11:23,519 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 29 [2019-12-07 19:11:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,519 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2019-12-07 19:11:23,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2019-12-07 19:11:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:11:23,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,520 INFO L410 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] [2019-12-07 19:11:23,520 INFO L410 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]=== [2019-12-07 19:11:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash -866894526, now seen corresponding path program 1 times [2019-12-07 19:11:23,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793942322] [2019-12-07 19:11:23,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793942322] [2019-12-07 19:11:23,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042798552] [2019-12-07 19:11:23,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,554 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand 5 states. [2019-12-07 19:11:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,651 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2019-12-07 19:11:23,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:11:23,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 19:11:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,653 INFO L225 Difference]: With dead ends: 254 [2019-12-07 19:11:23,653 INFO L226 Difference]: Without dead ends: 235 [2019-12-07 19:11:23,653 INFO L630 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 [2019-12-07 19:11:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-12-07 19:11:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2019-12-07 19:11:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-12-07 19:11:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2019-12-07 19:11:23,673 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 30 [2019-12-07 19:11:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,673 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2019-12-07 19:11:23,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2019-12-07 19:11:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:11:23,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,674 INFO L410 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] [2019-12-07 19:11:23,674 INFO L410 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]=== [2019-12-07 19:11:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1005243574, now seen corresponding path program 1 times [2019-12-07 19:11:23,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12185217] [2019-12-07 19:11:23,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12185217] [2019-12-07 19:11:23,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:11:23,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547020067] [2019-12-07 19:11:23,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:11:23,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:11:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:11:23,703 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand 4 states. [2019-12-07 19:11:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,781 INFO L93 Difference]: Finished difference Result 267 states and 318 transitions. [2019-12-07 19:11:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:11:23,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 19:11:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,782 INFO L225 Difference]: With dead ends: 267 [2019-12-07 19:11:23,782 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 19:11:23,782 INFO L630 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 [2019-12-07 19:11:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 19:11:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 211. [2019-12-07 19:11:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 19:11:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 252 transitions. [2019-12-07 19:11:23,795 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 252 transitions. Word has length 30 [2019-12-07 19:11:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,795 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 252 transitions. [2019-12-07 19:11:23,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:11:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 252 transitions. [2019-12-07 19:11:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:11:23,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:23,796 INFO L410 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]=== [2019-12-07 19:11:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1835927426, now seen corresponding path program 1 times [2019-12-07 19:11:23,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397432106] [2019-12-07 19:11:23,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397432106] [2019-12-07 19:11:23,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:23,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37044702] [2019-12-07 19:11:23,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:23,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:23,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:23,816 INFO L87 Difference]: Start difference. First operand 211 states and 252 transitions. Second operand 5 states. [2019-12-07 19:11:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:23,857 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2019-12-07 19:11:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:23,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 19:11:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:23,858 INFO L225 Difference]: With dead ends: 233 [2019-12-07 19:11:23,858 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 19:11:23,859 INFO L630 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 [2019-12-07 19:11:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 19:11:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2019-12-07 19:11:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 19:11:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2019-12-07 19:11:23,876 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 31 [2019-12-07 19:11:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:23,876 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2019-12-07 19:11:23,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2019-12-07 19:11:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:11:23,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:23,877 INFO L410 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] [2019-12-07 19:11:23,877 INFO L410 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]=== [2019-12-07 19:11:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash 237508247, now seen corresponding path program 1 times [2019-12-07 19:11:23,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:23,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22469971] [2019-12-07 19:11:23,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:23,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22469971] [2019-12-07 19:11:23,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:23,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:23,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563819104] [2019-12-07 19:11:23,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:23,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:23,925 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand 6 states. [2019-12-07 19:11:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,024 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2019-12-07 19:11:24,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:24,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 19:11:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,025 INFO L225 Difference]: With dead ends: 187 [2019-12-07 19:11:24,025 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 19:11:24,026 INFO L630 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 [2019-12-07 19:11:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 19:11:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2019-12-07 19:11:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 19:11:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2019-12-07 19:11:24,033 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 33 [2019-12-07 19:11:24,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,033 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2019-12-07 19:11:24,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2019-12-07 19:11:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:11:24,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,034 INFO L410 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]=== [2019-12-07 19:11:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash -828840542, now seen corresponding path program 1 times [2019-12-07 19:11:24,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430018713] [2019-12-07 19:11:24,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430018713] [2019-12-07 19:11:24,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:11:24,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858528540] [2019-12-07 19:11:24,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:11:24,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:11:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:11:24,086 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand 7 states. [2019-12-07 19:11:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,230 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2019-12-07 19:11:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:11:24,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-07 19:11:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,231 INFO L225 Difference]: With dead ends: 144 [2019-12-07 19:11:24,231 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 19:11:24,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:11:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 19:11:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-12-07 19:11:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 19:11:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2019-12-07 19:11:24,242 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 36 [2019-12-07 19:11:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,243 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2019-12-07 19:11:24,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:11:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2019-12-07 19:11:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:11:24,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,243 INFO L410 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]=== [2019-12-07 19:11:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -434854185, now seen corresponding path program 1 times [2019-12-07 19:11:24,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073811023] [2019-12-07 19:11:24,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073811023] [2019-12-07 19:11:24,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:24,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133225468] [2019-12-07 19:11:24,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:24,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:24,295 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand 5 states. [2019-12-07 19:11:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,368 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2019-12-07 19:11:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:24,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 19:11:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,369 INFO L225 Difference]: With dead ends: 138 [2019-12-07 19:11:24,369 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 19:11:24,369 INFO L630 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 [2019-12-07 19:11:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 19:11:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-12-07 19:11:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:11:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-12-07 19:11:24,376 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 39 [2019-12-07 19:11:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,377 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-12-07 19:11:24,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-12-07 19:11:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:11:24,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,377 INFO L410 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]=== [2019-12-07 19:11:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2131118984, now seen corresponding path program 1 times [2019-12-07 19:11:24,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481306581] [2019-12-07 19:11:24,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481306581] [2019-12-07 19:11:24,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:24,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244014530] [2019-12-07 19:11:24,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:24,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:24,402 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 6 states. [2019-12-07 19:11:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,450 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2019-12-07 19:11:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:24,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 19:11:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,450 INFO L225 Difference]: With dead ends: 107 [2019-12-07 19:11:24,450 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 19:11:24,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:11:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 19:11:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-07 19:11:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:11:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2019-12-07 19:11:24,458 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 40 [2019-12-07 19:11:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,458 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2019-12-07 19:11:24,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2019-12-07 19:11:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:11:24,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,459 INFO L410 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]=== [2019-12-07 19:11:24,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash 773342070, now seen corresponding path program 1 times [2019-12-07 19:11:24,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713317183] [2019-12-07 19:11:24,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713317183] [2019-12-07 19:11:24,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:11:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270056698] [2019-12-07 19:11:24,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:11:24,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:11:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:11:24,493 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand 7 states. [2019-12-07 19:11:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,569 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2019-12-07 19:11:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:24,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 19:11:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,569 INFO L225 Difference]: With dead ends: 132 [2019-12-07 19:11:24,570 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 19:11:24,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:11:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 19:11:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-12-07 19:11:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:11:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-12-07 19:11:24,577 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 40 [2019-12-07 19:11:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,577 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-12-07 19:11:24,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:11:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-12-07 19:11:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 19:11:24,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,578 INFO L410 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] [2019-12-07 19:11:24,578 INFO L410 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]=== [2019-12-07 19:11:24,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1443434369, now seen corresponding path program 1 times [2019-12-07 19:11:24,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227292341] [2019-12-07 19:11:24,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227292341] [2019-12-07 19:11:24,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:11:24,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975351994] [2019-12-07 19:11:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:11:24,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:11:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:24,597 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 3 states. [2019-12-07 19:11:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,614 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2019-12-07 19:11:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:11:24,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 19:11:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,615 INFO L225 Difference]: With dead ends: 165 [2019-12-07 19:11:24,615 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 19:11:24,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:11:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 19:11:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-12-07 19:11:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:11:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-12-07 19:11:24,626 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 43 [2019-12-07 19:11:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,627 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-12-07 19:11:24,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:11:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-12-07 19:11:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 19:11:24,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,627 INFO L410 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] [2019-12-07 19:11:24,628 INFO L410 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]=== [2019-12-07 19:11:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1535193216, now seen corresponding path program 1 times [2019-12-07 19:11:24,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669488547] [2019-12-07 19:11:24,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669488547] [2019-12-07 19:11:24,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:24,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108899923] [2019-12-07 19:11:24,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:24,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:24,665 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 6 states. [2019-12-07 19:11:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,733 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-12-07 19:11:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:11:24,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 19:11:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,734 INFO L225 Difference]: With dead ends: 105 [2019-12-07 19:11:24,734 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 19:11:24,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:11:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 19:11:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 19:11:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 19:11:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-12-07 19:11:24,743 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 43 [2019-12-07 19:11:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,743 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-12-07 19:11:24,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-12-07 19:11:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 19:11:24,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,744 INFO L410 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]=== [2019-12-07 19:11:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1844532147, now seen corresponding path program 1 times [2019-12-07 19:11:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407229843] [2019-12-07 19:11:24,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407229843] [2019-12-07 19:11:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611870037] [2019-12-07 19:11:24,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:24,783 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 6 states. [2019-12-07 19:11:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,854 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2019-12-07 19:11:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:11:24,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 19:11:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,854 INFO L225 Difference]: With dead ends: 87 [2019-12-07 19:11:24,854 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 19:11:24,855 INFO L630 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 [2019-12-07 19:11:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 19:11:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 19:11:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 19:11:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-12-07 19:11:24,864 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 49 [2019-12-07 19:11:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,864 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-12-07 19:11:24,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-12-07 19:11:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:11:24,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:11:24,865 INFO L410 AbstractCegarLoop]: === Iteration 46 === [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]=== [2019-12-07 19:11:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1302378184, now seen corresponding path program 1 times [2019-12-07 19:11:24,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849790167] [2019-12-07 19:11:24,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:24,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849790167] [2019-12-07 19:11:24,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:24,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:11:24,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432327480] [2019-12-07 19:11:24,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:11:24,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:11:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:11:24,923 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 6 states. [2019-12-07 19:11:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:24,980 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-12-07 19:11:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:11:24,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 19:11:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:24,981 INFO L225 Difference]: With dead ends: 87 [2019-12-07 19:11:24,981 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 19:11:24,981 INFO L630 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 [2019-12-07 19:11:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 19:11:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 19:11:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 19:11:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-12-07 19:11:24,991 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 52 [2019-12-07 19:11:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-12-07 19:11:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:11:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-12-07 19:11:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:11:24,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:24,992 INFO L410 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] [2019-12-07 19:11:24,992 INFO L410 AbstractCegarLoop]: === Iteration 47 === [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]=== [2019-12-07 19:11:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash -948000753, now seen corresponding path program 1 times [2019-12-07 19:11:24,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:24,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708276755] [2019-12-07 19:11:24,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:25,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708276755] [2019-12-07 19:11:25,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:11:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655539348] [2019-12-07 19:11:25,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:11:25,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:11:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:11:25,083 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 9 states. [2019-12-07 19:11:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:25,258 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2019-12-07 19:11:25,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:11:25,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-07 19:11:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:25,259 INFO L225 Difference]: With dead ends: 92 [2019-12-07 19:11:25,259 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 19:11:25,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:11:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 19:11:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 19:11:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 19:11:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-12-07 19:11:25,266 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 54 [2019-12-07 19:11:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:25,266 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-12-07 19:11:25,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:11:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-12-07 19:11:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 19:11:25,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:25,267 INFO L410 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] [2019-12-07 19:11:25,267 INFO L410 AbstractCegarLoop]: === Iteration 48 === [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]=== [2019-12-07 19:11:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1192472812, now seen corresponding path program 1 times [2019-12-07 19:11:25,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:25,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810388255] [2019-12-07 19:11:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:25,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810388255] [2019-12-07 19:11:25,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:25,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:11:25,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114317007] [2019-12-07 19:11:25,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:11:25,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:11:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:11:25,302 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-12-07 19:11:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:25,360 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-12-07 19:11:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:11:25,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-07 19:11:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:25,361 INFO L225 Difference]: With dead ends: 96 [2019-12-07 19:11:25,361 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 19:11:25,361 INFO L630 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 [2019-12-07 19:11:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 19:11:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-12-07 19:11:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 19:11:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-12-07 19:11:25,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2019-12-07 19:11:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:25,371 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-12-07 19:11:25,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:11:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-12-07 19:11:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 19:11:25,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:11:25,372 INFO L410 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] [2019-12-07 19:11:25,372 INFO L410 AbstractCegarLoop]: === Iteration 49 === [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]=== [2019-12-07 19:11:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:11:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -574628619, now seen corresponding path program 1 times [2019-12-07 19:11:25,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:11:25,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702952065] [2019-12-07 19:11:25,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:11:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:11:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:11:25,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702952065] [2019-12-07 19:11:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:11:25,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:11:25,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902643916] [2019-12-07 19:11:25,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:11:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:11:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:11:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:11:25,454 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2019-12-07 19:11:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:11:25,561 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-12-07 19:11:25,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:11:25,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-07 19:11:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:11:25,561 INFO L225 Difference]: With dead ends: 79 [2019-12-07 19:11:25,561 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:11:25,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:11:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:11:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:11:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:11:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:11:25,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-12-07 19:11:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:11:25,562 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:11:25,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:11:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:11:25,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:11:25,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:11:26,652 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-12-07 19:11:27,421 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-12-07 19:11:27,593 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-12-07 19:11:27,781 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-12-07 19:11:28,027 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-07 19:11:28,253 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-12-07 19:11:28,650 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-12-07 19:11:29,125 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-12-07 19:11:29,575 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-12-07 19:11:29,964 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-12-07 19:11:31,077 WARN L192 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-12-07 19:11:31,409 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-12-07 19:11:31,522 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-12-07 19:11:31,630 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-12-07 19:11:31,950 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-12-07 19:11:32,061 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-12-07 19:11:32,178 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-12-07 19:11:32,416 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-12-07 19:11:33,231 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 80 [2019-12-07 19:11:33,441 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-12-07 19:11:34,018 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-12-07 19:11:34,882 WARN L192 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 149 [2019-12-07 19:11:35,730 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 144 [2019-12-07 19:11:36,045 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-12-07 19:11:37,351 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 243 DAG size of output: 151 [2019-12-07 19:11:37,728 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2019-12-07 19:11:38,009 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-12-07 19:11:38,526 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-12-07 19:11:38,912 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-12-07 19:11:41,956 WARN L192 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 269 DAG size of output: 145 [2019-12-07 19:11:42,167 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-07 19:11:42,746 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-12-07 19:11:43,353 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 102 [2019-12-07 19:11:44,049 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-12-07 19:11:44,186 INFO L246 CegarLoopResult]: For program point L234-1(lines 227 415) no Hoare annotation was computed. [2019-12-07 19:11:44,186 INFO L246 CegarLoopResult]: For program point L1295(lines 1295 1309) no Hoare annotation was computed. [2019-12-07 19:11:44,186 INFO L246 CegarLoopResult]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-12-07 19:11:44,186 INFO L246 CegarLoopResult]: For program point L635(lines 635 640) no Hoare annotation was computed. [2019-12-07 19:11:44,186 INFO L246 CegarLoopResult]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L242 CegarLoopResult]: At program point L1560(lines 1181 1562) the Hoare annotation is: (let ((.cse5 (+ ~s~0 5))) (let ((.cse0 (= 1 ~pended~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= .cse5 ~IPC~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= ~s~0 ~NP~0) .cse2 .cse3 (<= .cse5 ~MPR3~0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) (<= (+ ~DC~0 5) ~IPC~0) .cse6 .cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~SKIP2~0 ~s~0) .cse7 .cse3 .cse8 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) .cse1 .cse9) (and .cse6 .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse10 .cse3 .cse4 .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (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)) .cse1 .cse9 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse1 .cse6 .cse2 .cse3 .cse4) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse1 .cse6 .cse2 .cse9 .cse10 .cse3 .cse4 (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0))))) [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point L1296(lines 1296 1302) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,187 INFO L246 CegarLoopResult]: For program point L375(lines 375 381) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L242 CegarLoopResult]: At program point L642(lines 610 644) the Hoare annotation is: (let ((.cse18 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= ~myStatus~0 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse18 1) 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259))) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse16 (= 1 ~compRegistered~0)) (.cse17 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point L510(lines 510 515) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L242 CegarLoopResult]: At program point L510-2(lines 510 515) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 19:11:44,188 INFO L242 CegarLoopResult]: At program point L116(lines 116 146) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point L116-2(lines 108 156) no Hoare annotation was computed. [2019-12-07 19:11:44,188 INFO L246 CegarLoopResult]: For program point L1041(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L242 CegarLoopResult]: At program point L116-3(lines 116 146) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-2(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L116-5(lines 108 156) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-4(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-6(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-8(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-10(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-12(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-14(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L1041-16(lines 1041 1047) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,189 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L242 CegarLoopResult]: At program point L785(lines 778 833) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2))) (let ((.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse13 (<= .cse21 ~s~0)) (.cse17 (= 1 ~pended~0)) (.cse14 (<= (+ ~DC~0 5) ~IPC~0)) (.cse18 (= 0 ~compRegistered~0)) (.cse15 (= ~SKIP2~0 ~s~0)) (.cse19 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse16 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse20 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= .cse21 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse10 .cse1 .cse12 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse13 .cse14 .cse1 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse2 .cse15 .cse6 .cse16 .cse8 .cse9 .cse10) (and .cse17 .cse14 .cse10 .cse18 .cse12 (= ~IPC~0 ~s~0)) (and .cse1 (= ULTIMATE.start_main_~status~1 0) .cse5) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse1 .cse19 .cse5) (and .cse17 .cse10 .cse18 .cse5) (and .cse0 .cse13 .cse14 .cse1 .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse15 .cse6 .cse16 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse12 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse0 .cse17 .cse14 .cse10 .cse18 .cse12 .cse15 .cse6 .cse8) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse10 .cse1 .cse19 .cse5) (and .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse4 .cse5 .cse6 .cse16 (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 .cse20 .cse12 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse5 .cse6 .cse8 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse9 .cse10 .cse20 .cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L242 CegarLoopResult]: At program point L1314(lines 1314 1548) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point L258(lines 258 289) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L242 CegarLoopResult]: At program point L127(lines 127 134) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,190 INFO L242 CegarLoopResult]: At program point L127-1(lines 127 134) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point L1450(lines 1450 1453) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point L526(lines 526 591) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point L526-1(lines 526 591) no Hoare annotation was computed. [2019-12-07 19:11:44,190 INFO L242 CegarLoopResult]: At program point L1319(lines 1319 1546) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,190 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,191 INFO L246 CegarLoopResult]: For program point L528(lines 528 568) no Hoare annotation was computed. [2019-12-07 19:11:44,191 INFO L242 CegarLoopResult]: At program point L793(lines 786 832) the Hoare annotation is: (let ((.cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse13 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse7 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse9 (<= ULTIMATE.start_main_~status~1 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse14 (= 1 ~pended~0)) (.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse16 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse2 (<= (+ ~s~0 5) ~IPC~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse3 (= ~s~0 ~DC~0))) (or (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse0 .cse4 .cse3) (and .cse5 .cse6 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse2 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse0 .cse12 .cse1) (and .cse5 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse6 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse2 .cse8 .cse3 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse10 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse11 .cse0 .cse1 .cse13 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse14 .cse0 .cse3) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse4 .cse3) (and .cse5 .cse14 .cse15 .cse0 .cse1 .cse16 .cse8 .cse10) (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse13 .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse2 .cse8 .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|)) .cse10) (and .cse5 .cse6 .cse2 .cse7 .cse8 .cse3 .cse9 (<= ~myStatus~0 0) .cse10 .cse11 .cse0 .cse12 .cse1) (and .cse14 .cse15 .cse0 .cse1 (= ~IPC~0 ~s~0)) (and .cse5 .cse15 .cse6 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse16 .cse8 .cse10 .cse11 .cse0 .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse11 .cse5 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse15 .cse0 .cse6 .cse1 .cse16 .cse8 .cse10) (and .cse5 .cse6 .cse2 .cse8 .cse3 .cse10 .cse11 .cse0 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse1 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (= ULTIMATE.start_main_~status~1 0) .cse3))) [2019-12-07 19:11:44,191 INFO L242 CegarLoopResult]: At program point L529(lines 529 539) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-12-07 19:11:44,191 INFO L249 CegarLoopResult]: At program point L794(lines 778 833) the Hoare annotation is: true [2019-12-07 19:11:44,191 INFO L242 CegarLoopResult]: At program point L662(lines 722 724) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,191 INFO L246 CegarLoopResult]: For program point L795(lines 795 830) no Hoare annotation was computed. [2019-12-07 19:11:44,191 INFO L246 CegarLoopResult]: For program point L796(lines 796 829) no Hoare annotation was computed. [2019-12-07 19:11:44,191 INFO L246 CegarLoopResult]: For program point L1589-2(lines 1587 1618) no Hoare annotation was computed. [2019-12-07 19:11:44,191 INFO L246 CegarLoopResult]: For program point L797(lines 797 807) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L269(lines 269 275) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L242 CegarLoopResult]: At program point L1592-1(lines 1592 1616) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse2 (+ ~s~0 5)) (.cse1 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse0 .cse1 (<= .cse2 ~MPR3~0)) (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= (+ ~DC~0 2) ~SKIP2~0) (<= .cse2 ~IPC~0) .cse1 (= ~s~0 ~DC~0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)))) [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1480) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1544) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1064(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1064-1(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1064-2(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1064-3(lines 1064 1083) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1464) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1065(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1065-2(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1065-4(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L1065-6(lines 1065 1070) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L142(lines 142 144) no Hoare annotation was computed. [2019-12-07 19:11:44,192 INFO L246 CegarLoopResult]: For program point L142-1(lines 142 144) no Hoare annotation was computed. [2019-12-07 19:11:44,193 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,193 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,193 INFO L242 CegarLoopResult]: At program point L541(lines 528 568) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-12-07 19:11:44,193 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1479) no Hoare annotation was computed. [2019-12-07 19:11:44,193 INFO L242 CegarLoopResult]: At program point L1072(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,193 INFO L242 CegarLoopResult]: At program point L1072-1(lines 1064 1083) the Hoare annotation is: false [2019-12-07 19:11:44,193 INFO L242 CegarLoopResult]: At program point L1072-2(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~s~0 5) ~MPR3~0) .cse6 .cse7) (and .cse0 (= 1 ~pended~0) .cse1 .cse2 (<= (+ ~NP~0 5) ~MPR3~0) .cse3 .cse4 .cse6 .cse5 .cse7))) [2019-12-07 19:11:44,193 INFO L242 CegarLoopResult]: At program point L1072-3(lines 1064 1083) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,193 INFO L246 CegarLoopResult]: For program point L1337(lines 1337 1542) no Hoare annotation was computed. [2019-12-07 19:11:44,194 INFO L242 CegarLoopResult]: At program point L809(lines 796 829) the Hoare annotation is: (let ((.cse17 (+ ~DC~0 2))) (let ((.cse2 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= .cse17 ~s~0)) (.cse13 (<= (+ ~DC~0 5) ~IPC~0)) (.cse11 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (<= (+ ~s~0 5) ~IPC~0)) (.cse14 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse15 (<= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse16 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse1 (<= .cse17 ~SKIP2~0)) (.cse4 (= ~s~0 ~DC~0))) (or (and (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse0 .cse1 .cse2 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse3 .cse4 .cse5 .cse6 (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) .cse7 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse0 .cse1 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse0 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse1 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse0 .cse11 .cse4) (and .cse8 .cse12 .cse13 .cse9 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse5 .cse7 .cse10 .cse0 .cse1 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse8 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse9 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse3 .cse4 .cse5 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse6 .cse7 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse10 .cse0 .cse1 .cse2 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (= 1 ~pended~0) .cse0) (and .cse10 .cse8 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse12 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse13 .cse0 .cse9 .cse1 .cse5 .cse7) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse0 .cse11 .cse4) (and .cse8 .cse9 .cse3 .cse14 .cse4 .cse5 .cse15 (<= ~myStatus~0 0) .cse6 .cse7 .cse10 .cse0 .cse16 .cse1) (and .cse8 .cse9 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse10 .cse0 .cse16 .cse1) (and (= ULTIMATE.start_main_~status~1 0) .cse4)))) [2019-12-07 19:11:44,194 INFO L246 CegarLoopResult]: For program point L1470(lines 1470 1478) no Hoare annotation was computed. [2019-12-07 19:11:44,194 INFO L242 CegarLoopResult]: At program point L1338(lines 1328 1544) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,194 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,194 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,194 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,194 INFO L242 CegarLoopResult]: At program point L548-2(lines 548 564) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-12-07 19:11:44,195 INFO L242 CegarLoopResult]: At program point L416(lines 227 417) the Hoare annotation is: (let ((.cse11 (= 1 ~pended~0)) (.cse13 (= 0 ~compRegistered~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse2 (<= (+ ~s~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse7 (= ~s~0 ~DC~0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse12 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse16 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= (+ ULTIMATE.start_FloppyPnp_~ntStatus~0 1073741823) 0) .cse10 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse11 .cse12 .cse10 .cse13 .cse14 .cse6 (= ~IPC~0 ~s~0)) (and .cse11 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse12 .cse10 .cse13 .cse14 .cse16 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) .cse0 (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) .cse12 .cse1 .cse3 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14))) [2019-12-07 19:11:44,195 INFO L246 CegarLoopResult]: For program point L1077(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 19:11:44,195 INFO L242 CegarLoopResult]: At program point L1077-1(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 19:11:44,195 INFO L246 CegarLoopResult]: For program point L1077-2(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 19:11:44,195 INFO L242 CegarLoopResult]: At program point L1077-3(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 19:11:44,195 INFO L246 CegarLoopResult]: For program point L1077-4(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 19:11:44,195 INFO L242 CegarLoopResult]: At program point L1077-5(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= ~s~0 ~NP~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse1 .cse2 (= 0 ~pended~0) .cse3 .cse4 .cse5 (<= (+ ~s~0 5) ~MPR3~0) .cse6 .cse7) (and .cse0 (= 1 ~pended~0) .cse2 .cse1 (<= (+ ~NP~0 5) ~MPR3~0) .cse3 .cse4 .cse6 .cse5 .cse7))) [2019-12-07 19:11:44,195 INFO L246 CegarLoopResult]: For program point L1077-6(lines 1077 1081) no Hoare annotation was computed. [2019-12-07 19:11:44,195 INFO L242 CegarLoopResult]: At program point L1077-7(lines 1077 1081) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)))) [2019-12-07 19:11:44,196 INFO L242 CegarLoopResult]: At program point L549(lines 548 564) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and .cse0 (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 0) .cse15 .cse16)))) [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L1474(lines 1474 1477) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L815(lines 815 827) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L1608(lines 1608 1614) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L242 CegarLoopResult]: At program point L155(lines 95 157) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 (<= (+ ~s~0 5) ~MPR3~0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 5) ~MPR3~0) .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) .cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))))) [2019-12-07 19:11:44,196 INFO L242 CegarLoopResult]: At program point L155-1(lines 95 157) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse0 (= 1 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse1 (= 0 ~pended~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8))) [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L816(lines 816 820) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L1346(lines 1346 1540) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L242 CegarLoopResult]: At program point L1482(lines 1346 1540) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L293-1(lines 227 415) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L954(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,196 INFO L246 CegarLoopResult]: For program point L954-2(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-4(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L822(lines 822 826) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-6(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-8(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-10(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-12(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-14(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-16(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-18(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L954-20(lines 954 960) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L560(lines 560 562) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L242 CegarLoopResult]: At program point L429(lines 158 431) the Hoare annotation is: (let ((.cse13 (= 1 ~pended~0)) (.cse14 (<= (+ ~DC~0 5) ~IPC~0)) (.cse15 (= 0 ~compRegistered~0)) (.cse16 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse17 (= ~SKIP2~0 ~s~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse12 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse2 (<= (+ ~s~0 2) ~SKIP2~0)) (.cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= (+ ~s~0 5) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse10 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse11 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~pended~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse11 .cse15 .cse16 .cse7 (= ~IPC~0 ~s~0)) (and .cse13 .cse11 .cse15 .cse7 .cse8) (and .cse0 .cse14 .cse1 .cse3 .cse17 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse6 .cse7 .cse9 .cse10 .cse11 .cse16 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse0 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~myStatus~0 0) .cse9 .cse10 .cse11 .cse12) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 .cse6 .cse7 .cse8 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse9 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse10 .cse11 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1))) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse11 .cse1 .cse7 .cse8))) [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L1355(lines 1355 1538) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point L299(lines 299 305) no Hoare annotation was computed. [2019-12-07 19:11:44,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L242 CegarLoopResult]: At program point L565(lines 526 591) the Hoare annotation is: (let ((.cse17 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse5 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ .cse17 1) 0)) (.cse9 (<= ~myStatus~0 0)) (.cse10 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse11 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse15 (= 1 ~compRegistered~0)) (.cse16 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse17) 3221225494)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 .cse3 .cse4 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse5 .cse6 .cse7 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1536) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-2(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-3(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-4(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-5(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-6(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-7(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-8(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,198 INFO L246 CegarLoopResult]: For program point L1625-9(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-10(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-11(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-12(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-13(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-14(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-15(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-16(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-17(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-18(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-19(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-20(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-21(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-22(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-23(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-24(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-25(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-26(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-27(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,199 INFO L246 CegarLoopResult]: For program point L1625-28(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-29(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-30(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-31(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-1(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-32(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-2(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~s~0 5) ~IPC~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-33(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-3(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-34(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-4(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-35(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-5(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-36(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L246 CegarLoopResult]: For program point L1625-37(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,200 INFO L242 CegarLoopResult]: At program point L1626-7(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-38(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L242 CegarLoopResult]: At program point L1626-8(lines 1 1628) the Hoare annotation is: (and (= 1 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0)) [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-39(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L242 CegarLoopResult]: At program point L1626-9(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-40(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-41(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L242 CegarLoopResult]: At program point L1626-11(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-42(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-43(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L242 CegarLoopResult]: At program point L1626-13(lines 1037 1050) the Hoare annotation is: (and (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~s~0 ~DC~0)) [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-44(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-45(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-46(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L246 CegarLoopResult]: For program point L1625-47(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,201 INFO L242 CegarLoopResult]: At program point L1626-17(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,202 INFO L246 CegarLoopResult]: For program point L1625-48(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,202 INFO L246 CegarLoopResult]: For program point L1625-49(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,202 INFO L246 CegarLoopResult]: For program point L1625-50(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-20(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (or (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 258) (< 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,202 INFO L246 CegarLoopResult]: For program point L1625-51(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,202 INFO L246 CegarLoopResult]: For program point L1625-52(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-22(lines 1037 1050) the Hoare annotation is: (let ((.cse16 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse3 (<= (+ ~s~0 5) ~IPC~0)) (.cse15 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (= ~s~0 ~DC~0)) (.cse7 (<= (+ .cse16 1) 0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (= 1 ~compRegistered~0)) (.cse14 (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_FloppyStartDevice_~ntStatus~1 1073741670) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_FlFdcDeviceIo_#res| 1073741670) 0) .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse3 .cse15 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-23(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-25(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-26(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 1 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,202 INFO L242 CegarLoopResult]: At program point L1626-28(lines 1 1628) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-30(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse7 (= ~SKIP2~0 ~s~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse9 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0)) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5 .cse9) (and .cse6 .cse1 (= 0 ~pended~0) .cse3 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse7 .cse8 .cse5 .cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse2 .cse4))) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-32(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,203 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-34(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-38(lines 1 1628) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (or .cse0 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse1 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (or .cse0 (= ~MPR3~0 ~s~0)) (= 1 ~compRegistered~0) (or .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse1) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-41(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-43(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,203 INFO L242 CegarLoopResult]: At program point L1626-44(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,204 INFO L242 CegarLoopResult]: At program point L1626-46(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,204 INFO L242 CegarLoopResult]: At program point L1626-47(lines 1 1628) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,204 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,204 INFO L242 CegarLoopResult]: At program point L1626-49(lines 1 1628) the Hoare annotation is: (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0) (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~SKIP2~0 ~s~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,204 INFO L249 CegarLoopResult]: At program point L835(lines 665 837) the Hoare annotation is: true [2019-12-07 19:11:44,204 INFO L242 CegarLoopResult]: At program point L705(lines 699 836) the Hoare annotation is: (let ((.cse18 (+ ~s~0 5))) (let ((.cse3 (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0)) (.cse7 (<= ULTIMATE.start_main_~status~1 0)) (.cse11 (<= |ULTIMATE.start_FloppyPnp_#res| 0)) (.cse15 (= 1 ~pended~0)) (.cse13 (<= (+ ~DC~0 5) ~IPC~0)) (.cse16 (= 0 ~compRegistered~0)) (.cse14 (= ~SKIP2~0 ~s~0)) (.cse17 (<= (+ ULTIMATE.start_main_~status~1 1073741738) 0)) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (<= ~lowerDriverReturn~0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (.cse4 (<= .cse18 ~IPC~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (.cse9 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 ~lowerDriverReturn~0)) (.cse10 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse19 (or (<= ULTIMATE.start_main_~status~1 258) (<= 260 ULTIMATE.start_main_~status~1))) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~myStatus~0 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741536) 0) .cse10 .cse1 .cse12 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~status~1 1073741536) 0) (<= (+ ULTIMATE.start_FloppyQueueRequest_~ntStatus~4 1073741536) 0)) (and .cse0 .cse13 .cse1 .cse2 (<= ~lowerDriverReturn~0 |ULTIMATE.start_FloppyPnp_#res|) .cse14 .cse6 .cse8 .cse9 .cse10 .cse12 (<= |ULTIMATE.start_FloppyPnp_#res| ~lowerDriverReturn~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse13 .cse10 .cse16 .cse12 (= ~IPC~0 ~s~0)) (and .cse1 (= ULTIMATE.start_main_~status~1 0) .cse5) (and (<= (+ |ULTIMATE.start_FloppyPnp_#res| 1073741738) 0) .cse10 .cse1 .cse17 .cse5) (and .cse9 .cse0 (= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1) .cse13 .cse10 .cse1 (= |ULTIMATE.start_FloppyDeviceControl_#res| ~lowerDriverReturn~0) .cse12 .cse2 .cse14 .cse6 .cse8) (and .cse15 .cse10 .cse16 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_FloppyPnp_~ntStatus~0 259)) .cse12 (not (= ULTIMATE.start_main_~status~1 259)) (not (= 259 |ULTIMATE.start_FloppyPnp_#res|)) (= ULTIMATE.start_FloppyPnp_~ntStatus~0 ULTIMATE.start_FloppyPnp_~__cil_tmp30~0)) (and .cse15 (= ~s~0 ~NP~0) .cse16 (<= .cse18 ~MPR3~0)) (and .cse0 .cse15 .cse13 .cse10 .cse16 .cse12 .cse14 .cse6 .cse8) (and (<= (+ |ULTIMATE.start_FloppyDeviceControl_#res| 1073741738) 0) .cse10 .cse1 .cse17 .cse5) (and .cse1 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) .cse4 .cse5 .cse6 (<= (+ ~NP~0 4) ~MPR1~0) (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 .cse19 .cse12 (or (<= |ULTIMATE.start_FloppyDeviceControl_#res| 258) (<= 260 |ULTIMATE.start_FloppyDeviceControl_#res|))) (and .cse0 (or (< 258 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0)) (or (<= 260 |ULTIMATE.start_FlFdcDeviceIo_#res|) (<= |ULTIMATE.start_FlFdcDeviceIo_#res| 258)) .cse1 .cse2 (or (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~__cil_tmp11~0 259)) .cse4 (or (<= 260 ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2) (<= ULTIMATE.start_FlFdcDeviceIo_~ntStatus~2 258)) .cse5 .cse6 .cse8 (or (<= 260 |ULTIMATE.start_FloppyPnp_#res|) (<= |ULTIMATE.start_FloppyPnp_#res| 258)) .cse9 .cse10 .cse19 .cse12 (or (<= 260 ULTIMATE.start_FloppyPnp_~ntStatus~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 258)) (or (<= ULTIMATE.start_FloppyStartDevice_~ntStatus~1 258) (<= 260 ULTIMATE.start_FloppyStartDevice_~ntStatus~1)))))) [2019-12-07 19:11:44,204 INFO L246 CegarLoopResult]: For program point L1367(lines 1367 1534) no Hoare annotation was computed. [2019-12-07 19:11:44,204 INFO L242 CegarLoopResult]: At program point L972(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-1(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-2(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-3(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-4(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-5(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-6(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (= 0 ~pended~0) (<= (+ ~DC~0 5) ~IPC~0) (= ~s~0 ~NP~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~s~0 5) ~MPR3~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= 1 ~compRegistered~0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-7(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-8(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-9(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,205 INFO L242 CegarLoopResult]: At program point L972-10(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-11(lines 972 984) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-12(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,206 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-13(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-14(lines 972 984) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-15(lines 972 984) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-16(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-17(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-18(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,206 INFO L242 CegarLoopResult]: At program point L972-19(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,207 INFO L242 CegarLoopResult]: At program point L972-20(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,207 INFO L242 CegarLoopResult]: At program point L972-21(lines 972 984) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L1374(lines 1374 1532) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L317(lines 317 329) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978-2(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978-4(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978-6(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978-8(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,207 INFO L246 CegarLoopResult]: For program point L978-10(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L978-12(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L978-14(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L978-16(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L978-18(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L978-20(lines 978 982) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L242 CegarLoopResult]: At program point L322-1(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1530) no Hoare annotation was computed. [2019-12-07 19:11:44,208 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,209 INFO L242 CegarLoopResult]: At program point L1382(lines 1374 1532) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,209 INFO L246 CegarLoopResult]: For program point L196(lines 196 204) no Hoare annotation was computed. [2019-12-07 19:11:44,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,209 INFO L242 CegarLoopResult]: At program point L728(lines 728 776) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,209 INFO L242 CegarLoopResult]: At program point L1524(lines 1399 1525) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) .cse0 (<= (+ ~NP~0 5) ~MPR3~0) .cse1 (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 0) .cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) (and (= 1 ~pended~0) .cse0 .cse1 .cse2 (<= (+ ~s~0 5) ~MPR3~0)))) [2019-12-07 19:11:44,209 INFO L242 CegarLoopResult]: At program point L733(lines 733 775) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,209 INFO L242 CegarLoopResult]: At program point L205(lines 205 424) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 19:11:44,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point L338(lines 338 343) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 343) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point L208(lines 208 423) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L1398(lines 1388 1528) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L738(lines 738 774) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point L211(lines 211 422) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L212(lines 208 423) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,210 INFO L246 CegarLoopResult]: For program point L214(lines 214 421) no Hoare annotation was computed. [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L1007(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L1007-1(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,210 INFO L242 CegarLoopResult]: At program point L1007-2(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-3(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-4(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-5(lines 971 1035) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= (+ ~s~0 2) ~MPR1~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ULTIMATE.start_main_~status~1 0)) (.cse6 (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0))) (.cse7 (<= (+ ~NP~0 2) ~s~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ |ULTIMATE.start_FlQueueIrpToThread_#res| 1) 0) .cse0 (= 0 ~pended~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-6(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-7(lines 971 1035) the Hoare annotation is: (let ((.cse0 (div ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ .cse0 1) 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~MPR1~0 ~s~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (= 1 ~compRegistered~0) (<= ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse0) 3221225494)) (= ~setEventCalled~0 1))) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L743(lines 743 773) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= ~customIrp~0 0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-8(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-9(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,211 INFO L242 CegarLoopResult]: At program point L1007-10(lines 971 1035) the Hoare annotation is: (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~compRegistered~0) (<= (+ ~s~0 2) ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~s~0 ~IPC~0)) (<= (+ ~NP~0 2) ~s~0) (= ~SKIP1~0 ~s~0)) [2019-12-07 19:11:44,212 INFO L242 CegarLoopResult]: At program point L83(lines 705 777) the Hoare annotation is: (let ((.cse1 (+ ~s~0 5)) (.cse0 (+ ~s~0 2))) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= .cse0 ~SKIP2~0) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= .cse1 ~MPR3~0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse0 ~MPR1~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ULTIMATE.start_main_~status~1 ~lowerDriverReturn~0) (<= ~lowerDriverReturn~0 ULTIMATE.start_main_~status~1))) [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1273(lines 1273 1285) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1273-2(lines 1272 1561) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L217(lines 217 420) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L242 CegarLoopResult]: At program point L218(lines 214 421) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0)) [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L242 CegarLoopResult]: At program point L220(lines 220 419) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1278(lines 1278 1283) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015-1(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015-2(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015-3(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015-4(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,212 INFO L246 CegarLoopResult]: For program point L1015-5(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1015-6(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1015-7(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1015-8(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1015-9(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1015-10(lines 1015 1032) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L242 CegarLoopResult]: At program point L223(lines 223 418) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L489(lines 489 501) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L358(lines 358 364) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L242 CegarLoopResult]: At program point L226(lines 225 418) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0))) [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L625(lines 625 627) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L494(lines 494 500) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L242 CegarLoopResult]: At program point L494-1(lines 1 1628) the Hoare annotation is: (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= ULTIMATE.start_FloppyPnp_~ntStatus~0 0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ULTIMATE.start_main_~status~1 0) (<= ~myStatus~0 0) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (<= ~customIrp~0 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (= 1 ~compRegistered~0)) [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point L1552(lines 1552 1558) no Hoare annotation was computed. [2019-12-07 19:11:44,213 INFO L242 CegarLoopResult]: At program point L1552-1(lines 1552 1558) the Hoare annotation is: (let ((.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= ~s~0 ~DC~0)) (.cse5 (= 1 ~pended~0)) (.cse0 (= 0 ~compRegistered~0)) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse1 (+ ~s~0 5))) (or (and (= 0 ~pended~0) .cse0 (or (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3) (<= ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0 259)) (<= .cse1 ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse2 .cse3 (<= (+ ~NP~0 4) ~MPR1~0) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 258) (<= 260 ULTIMATE.start_FloppyDeviceControl_~ntStatus~3)) (<= (+ ~SKIP2~0 ~NP~0 5) (+ ~IPC~0 ~SKIP1~0)) (or (<= ULTIMATE.start_FloppyDeviceControl_~ntStatus~3 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0) (< 258 ULTIMATE.start_FloppyDeviceControl_~__cil_tmp91~0)) .cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (and .cse5 .cse4 .cse0 .cse2 .cse3) (and .cse5 (= ~s~0 ~NP~0) .cse0 .cse2 (<= .cse1 ~MPR3~0)))) [2019-12-07 19:11:44,213 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-2(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-4(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-6(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-8(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-10(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-12(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-14(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-16(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-18(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point L1024-20(lines 1024 1031) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,214 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1625) no Hoare annotation was computed. [2019-12-07 19:11:44,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:11:44 BoogieIcfgContainer [2019-12-07 19:11:44,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:11:44,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:11:44,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:11:44,290 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:11:44,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:11:18" (3/4) ... [2019-12-07 19:11:44,293 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:11:44,325 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 265 nodes and edges [2019-12-07 19:11:44,329 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 96 nodes and edges [2019-12-07 19:11:44,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-12-07 19:11:44,336 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:11:44,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && \result == lowerDriverReturn) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((1 == pended && s == NP) && 0 == compRegistered) && s + 5 <= MPR3)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 19:11:44,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || ((((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 19:11:44,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && IPC == s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (status == 0 && s == DC) [2019-12-07 19:11:44,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (\result <= 258 || 260 <= \result)) || ((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (1 == pended && NP + 5 <= MPR3)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 2 <= s) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (status == 0 && s == DC) [2019-12-07 19:11:44,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0)) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status == 0) && s == DC) [2019-12-07 19:11:44,370 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) [2019-12-07 19:11:44,372 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && NP + 5 <= MPR3) && 0 == pended) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && ntStatus == __cil_tmp30)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) [2019-12-07 19:11:44,372 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && 0 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) [2019-12-07 19:11:44,372 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && s == NP) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) [2019-12-07 19:11:44,373 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) [2019-12-07 19:11:44,373 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) [2019-12-07 19:11:44,373 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) [2019-12-07 19:11:44,374 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) [2019-12-07 19:11:44,374 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) [2019-12-07 19:11:44,374 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((0 == pended && 0 == compRegistered) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && status == 0) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) [2019-12-07 19:11:44,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) [2019-12-07 19:11:44,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) [2019-12-07 19:11:44,488 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aca3faf3-a653-46cf-a9a8-49375e906e4f/bin/utaipan/witness.graphml [2019-12-07 19:11:44,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:11:44,489 INFO L168 Benchmark]: Toolchain (without parser) took 28640.35 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 625.0 MB). Free memory was 934.1 MB in the beginning and 826.4 MB in the end (delta: 107.6 MB). Peak memory consumption was 732.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,489 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:11:44,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,489 INFO L168 Benchmark]: Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,490 INFO L168 Benchmark]: RCFGBuilder took 1688.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 917.4 MB in the end (delta: 130.4 MB). Peak memory consumption was 226.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,490 INFO L168 Benchmark]: TraceAbstraction took 26267.25 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 917.4 MB in the beginning and 895.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 627.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,490 INFO L168 Benchmark]: Witness Printer took 197.79 ms. Allocated memory is still 1.7 GB. Free memory was 895.3 MB in the beginning and 826.4 MB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:11:44,491 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.1 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1688.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 917.4 MB in the end (delta: 130.4 MB). Peak memory consumption was 226.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26267.25 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 917.4 MB in the beginning and 895.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 627.2 MB. Max. memory is 11.5 GB. * Witness Printer took 197.79 ms. Allocated memory is still 1.7 GB. Free memory was 895.3 MB in the beginning and 826.4 MB in the end (delta: 68.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1625]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && 0 == pended) && DC + 5 <= IPC) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: (((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && ntStatus == __cil_tmp30) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (returnVal2 <= 258 || 259 < returnVal2)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && ntStatus == __cil_tmp30) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) || (((((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && \result + 1 <= 0) && s == NP) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && ntStatus <= 0) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 705]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s + 5 <= MPR3) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status <= lowerDriverReturn) && lowerDriverReturn <= status - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && (s == NP || MPR3 == s)) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 1319]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn == status) && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && \result == lowerDriverReturn) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || ((((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && s == NP) && DC + 2 <= SKIP2) && ntStatus <= 0) && status == 0) && s + 5 <= MPR3) && SKIP1 + 2 <= MPR1) && 1 == compRegistered) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 786]: Loop Invariant Derived loop invariant: ((((((((((((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((1 == pended && NP + 5 <= MPR3) && s == DC)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && (\result <= 258 || 260 <= \result)) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || ((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && IPC == s)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (status == 0 && s == DC) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus + 1 <= 0) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || (((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && (260 <= ntStatus || ntStatus <= 258)) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus))) || (((((((((((((((((((NP + 2 <= SKIP1 && \result <= 0) && DC + 5 <= IPC) && 0 == pended) && s == NP) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && ntStatus <= 0) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2) || (((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && ntStatus <= 0) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && IPC == s)) || ((0 == pended && status == 0) && s == DC)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || (((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && \result == lowerDriverReturn) && DC + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((1 == pended && s == NP) && 0 == compRegistered) && s + 5 <= MPR3)) || ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((0 == pended && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && (260 <= ntStatus || ntStatus <= 258)) && s == DC) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (status <= 258 || 260 <= status)) && DC + 2 <= SKIP2) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus)) || (((((((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && NP + 5 <= MPR3) && 0 == pended) && s + 2 <= SKIP2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && ntStatus == __cil_tmp30)) || ((((((((((((ntStatus <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn <= ntStatus) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1 <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) - InvariantResult [Line: 1374]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1328]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && ntStatus + 1073741670 <= 0) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && \result + 1073741670 <= 0) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) || ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494)) || ((((((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && ntStatus <= 0) && (260 <= ntStatus || ntStatus <= 258)) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && __cil_tmp7 / 4294967296 + 1 <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && (ntStatus <= 258 || 260 <= ntStatus)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 1 == compRegistered - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && customIrp <= 0) && ((returnVal2 <= 258 || 259 < returnVal2) || MPR3 == s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 796]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((ntStatus <= __cil_tmp91 || 258 < __cil_tmp91) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (\result <= 258 || 260 <= \result)) || ((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s + 5 <= IPC) && s == DC) && status + 1073741536 <= 0) && ntStatus + 1073741536 <= 0)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && DC + 2 <= SKIP2) && !(status == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 2 <= s) && DC + 5 <= IPC) && lowerDriverReturn <= returnVal2) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn) && status <= lowerDriverReturn) && lowerDriverReturn <= status)) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && s == DC) && SKIP1 + 2 <= MPR1) && (260 <= ntStatus || ntStatus <= 258)) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (status <= 258 || 260 <= status)) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || (1 == pended && NP + 5 <= MPR3)) || ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && lowerDriverReturn == status) && DC + 2 <= s) && \result == lowerDriverReturn) && DC + 5 <= IPC) && NP + 5 <= MPR3) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && status + 1073741738 <= 0) && s == DC)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && myStatus <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (((((((((((((NP + 2 <= SKIP1 && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && s == DC) && SKIP1 + 2 <= MPR1) && status <= 0) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) && DC + 2 <= SKIP2)) || (status == 0 && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((((((((((NP + 2 <= SKIP1 && customIrp <= 0) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP + 2 <= SKIP1 && (s == NP || 259 <= returnVal2)) && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && ((returnVal2 <= 258 || 259 < returnVal2) || MPR3 == s)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && (s == NP || returnVal2 <= 259)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && ntStatus <= 0) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0) || ((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && status == 0) && IPC == s)) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && lowerDriverReturn <= \result) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && \result <= lowerDriverReturn)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && !(ntStatus == 259)) && !(259 == \result)) && ntStatus == __cil_tmp30)) || (((((((((NP + 2 <= SKIP1 && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1)) || (((((((((((((NP + 2 <= SKIP1 && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && s + 5 <= IPC) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && \result <= 0)) || (((((((((((((((((NP + 2 <= SKIP1 && (258 < __cil_tmp11 || ntStatus <= __cil_tmp11)) && (260 <= \result || \result <= 258)) && 0 == pended) && s + 2 <= SKIP2) && lowerDriverReturn <= returnVal2) && (__cil_tmp11 <= ntStatus || __cil_tmp11 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && (260 <= ntStatus || ntStatus <= 258)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (260 <= \result || \result <= 258)) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && (260 <= ntStatus || ntStatus <= 258)) && (ntStatus <= 258 || 260 <= ntStatus))) || ((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && status == 0) && s == DC) - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && customIrp <= 0) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && ntStatus <= 0) && SKIP1 + 2 <= MPR1) && status == 0) && __cil_tmp7 / 4294967296 + 1 <= 0) && myStatus <= 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && 1 == compRegistered) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && setEventCalled == 1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: ((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: (((((((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) || ((((((((((\result + 1 <= 0 && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: (((((((((((((0 == pended && 0 == compRegistered) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && SKIP1 + 2 <= MPR1) && status == 0) && s == DC) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC)) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((returnVal2 <= lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1 - InvariantResult [Line: 971]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC - InvariantResult [Line: 1181]: Loop Invariant Derived loop invariant: ((((((((1 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3)) || ((((((((((((NP + 2 <= SKIP1 && \result == lowerDriverReturn) && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && lowerDriverReturn <= returnVal2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && status == 0) && SKIP2 + NP + 5 <= IPC + SKIP1) && returnVal2 <= lowerDriverReturn) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || (((((((((((((0 == pended && 0 == compRegistered) && (__cil_tmp91 <= ntStatus || __cil_tmp91 <= 259)) && s + 5 <= IPC) && status == 0) && s == DC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (ntStatus <= 258 || 260 <= ntStatus)) && SKIP2 + NP + 5 <= IPC + SKIP1) && (ntStatus <= __cil_tmp91 || 258 < __cil_tmp91)) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (\result <= 258 || 260 <= \result))) || (((((\result + 1073741738 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && status == 0) && s == DC)) || ((((((((\result + 1073741536 <= 0 && NP + 5 <= MPR3) && 0 == pended) && 0 == compRegistered) && DC + 2 <= SKIP2) && s + 5 <= IPC) && status == 0) && s == DC) && ntStatus + 1073741536 <= 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3 - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: (((0 == pended && NP + 5 <= MPR3) && 0 == compRegistered) && status == 0) && s == DC - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && 0 == compRegistered) && s + 2 <= MPR1) && DC + 2 <= SKIP2) && status == 0) && SKIP2 + NP + 5 <= s + IPC) && NP + 2 <= s) && SKIP1 == s - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: ((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && ntStatus <= 0) && status == 0) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && SKIP2 + NP + 5 <= IPC + SKIP1) || ((((1 == pended && s == NP) && 0 == compRegistered) && status == 0) && s + 5 <= MPR3) - InvariantResult [Line: 1037]: Loop Invariant Derived loop invariant: ((0 == pended && 0 == compRegistered) && status == 0) && s == DC - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 351 locations, 53 error locations. Result: SAFE, OverallTime: 7.5s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.6s, HoareTripleCheckerStatistics: 11916 SDtfs, 9001 SDslu, 16681 SDs, 0 SdLazy, 5003 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred 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: 0.6s AutomataMinimizationTime, 49 MinimizatonAttempts, 777 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 114 LocationsWithAnnotation, 114 PreInvPairs, 347 NumberOfFragments, 10924 HoareAnnotationTreeSize, 114 FomulaSimplifications, 7809671 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 114 FomulaSimplificationsInter, 1467986 FormulaSimplificationTreeSizeReductionInter, 17.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1318 ConstructedInterpolants, 0 QuantifiedInterpolants, 107766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...