./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:39:42,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:39:42,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:39:43,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:39:43,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:39:43,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:39:43,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:39:43,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:39:43,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:39:43,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:39:43,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:39:43,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:39:43,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:39:43,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:39:43,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:39:43,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:39:43,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:39:43,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:39:43,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:39:43,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:39:43,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:39:43,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:39:43,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:39:43,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:39:43,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:39:43,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:39:43,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:39:43,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:39:43,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:39:43,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:39:43,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:39:43,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:39:43,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:39:43,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:39:43,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:39:43,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:39:43,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:39:43,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:39:43,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:39:43,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:39:43,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:39:43,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 04:39:43,145 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:39:43,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:39:43,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:39:43,146 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:39:43,146 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:39:43,147 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:39:43,147 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:39:43,147 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:39:43,147 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:39:43,148 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:39:43,148 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:39:43,148 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:39:43,148 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:39:43,148 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:39:43,149 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:39:43,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:39:43,150 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:39:43,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:39:43,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:39:43,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:39:43,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:39:43,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:39:43,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:39:43,151 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:39:43,151 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:39:43,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:39:43,152 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:39:43,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:39:43,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:39:43,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:39:43,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:39:43,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:39:43,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:39:43,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:39:43,154 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:39:43,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:39:43,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:39:43,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:39:43,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:39:43,155 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 [2021-10-29 04:39:43,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:39:43,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:39:43,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:39:43,419 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:39:43,420 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:39:43,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-10-29 04:39:43,489 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/data/3f3c83503/a85b1cfe50a74e739f3905f7b97334c4/FLAG255abbd97 [2021-10-29 04:39:44,134 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:39:44,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-10-29 04:39:44,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/data/3f3c83503/a85b1cfe50a74e739f3905f7b97334c4/FLAG255abbd97 [2021-10-29 04:39:44,385 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/data/3f3c83503/a85b1cfe50a74e739f3905f7b97334c4 [2021-10-29 04:39:44,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:39:44,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:39:44,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:39:44,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:39:44,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:39:44,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:39:44" (1/1) ... [2021-10-29 04:39:44,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc8134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:44, skipping insertion in model container [2021-10-29 04:39:44,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:39:44" (1/1) ... [2021-10-29 04:39:44,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:39:44,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:39:44,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-10-29 04:39:44,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:39:44,799 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:39:44,966 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-10-29 04:39:44,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:39:44,999 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:39:45,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45 WrapperNode [2021-10-29 04:39:45,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:39:45,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:39:45,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:39:45,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:39:45,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:39:45,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:39:45,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:39:45,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:39:45,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:39:45,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:39:45,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:39:45,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:39:45,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (1/1) ... [2021-10-29 04:39:45,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:39:45,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:39:45,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:39:45,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:39:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:39:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:39:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:39:45,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:39:45,699 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,719 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,728 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,734 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,736 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,737 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,741 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,756 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,760 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,761 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,763 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,766 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,770 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,772 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,772 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,775 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,777 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,777 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,778 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,780 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,785 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,788 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,790 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,793 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,796 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,797 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,797 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:45,800 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 04:39:46,965 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-10-29 04:39:46,965 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-29 04:39:46,966 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-10-29 04:39:46,967 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-10-29 04:39:46,967 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-29 04:39:46,967 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-29 04:39:46,967 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-29 04:39:46,967 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-29 04:39:46,968 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-10-29 04:39:46,968 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-10-29 04:39:46,968 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-10-29 04:39:46,969 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-10-29 04:39:46,969 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-29 04:39:46,970 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-29 04:39:46,970 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-10-29 04:39:46,970 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-10-29 04:39:46,970 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-10-29 04:39:46,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-10-29 04:39:46,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-10-29 04:39:46,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-10-29 04:39:46,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-29 04:39:46,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-29 04:39:46,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-10-29 04:39:46,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-10-29 04:39:46,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-10-29 04:39:46,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-10-29 04:39:46,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-10-29 04:39:46,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-10-29 04:39:46,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-10-29 04:39:46,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-10-29 04:39:48,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:39:48,204 INFO L299 CfgBuilder]: Removed 277 assume(true) statements. [2021-10-29 04:39:48,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:39:48 BoogieIcfgContainer [2021-10-29 04:39:48,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:39:48,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:39:48,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:39:48,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:39:48,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:39:44" (1/3) ... [2021-10-29 04:39:48,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e95e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:39:48, skipping insertion in model container [2021-10-29 04:39:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:39:45" (2/3) ... [2021-10-29 04:39:48,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e95e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:39:48, skipping insertion in model container [2021-10-29 04:39:48,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:39:48" (3/3) ... [2021-10-29 04:39:48,216 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2021-10-29 04:39:48,222 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:39:48,222 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-10-29 04:39:48,271 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:39:48,277 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:39:48,277 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-10-29 04:39:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 299 states have (on average 1.7759197324414715) internal successors, (531), 353 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 04:39:48,305 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:48,306 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 04:39:48,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 120284422, now seen corresponding path program 1 times [2021-10-29 04:39:48,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:48,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766823489] [2021-10-29 04:39:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:48,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:48,559 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:48,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766823489] [2021-10-29 04:39:48,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766823489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:48,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:48,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:48,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018843964] [2021-10-29 04:39:48,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:48,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:48,586 INFO L87 Difference]: Start difference. First operand has 354 states, 299 states have (on average 1.7759197324414715) internal successors, (531), 353 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:48,948 INFO L93 Difference]: Finished difference Result 646 states and 963 transitions. [2021-10-29 04:39:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-29 04:39:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:48,973 INFO L225 Difference]: With dead ends: 646 [2021-10-29 04:39:48,973 INFO L226 Difference]: Without dead ends: 365 [2021-10-29 04:39:48,980 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-10-29 04:39:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2021-10-29 04:39:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 344 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 467 transitions. [2021-10-29 04:39:49,059 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 467 transitions. Word has length 6 [2021-10-29 04:39:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:49,059 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 467 transitions. [2021-10-29 04:39:49,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 467 transitions. [2021-10-29 04:39:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 04:39:49,061 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:49,061 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:49,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:39:49,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1927424465, now seen corresponding path program 1 times [2021-10-29 04:39:49,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:49,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466264773] [2021-10-29 04:39:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:49,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:49,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:49,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466264773] [2021-10-29 04:39:49,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466264773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:49,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:49,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:39:49,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519316909] [2021-10-29 04:39:49,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:49,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:49,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,116 INFO L87 Difference]: Start difference. First operand 345 states and 467 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:49,150 INFO L93 Difference]: Finished difference Result 387 states and 516 transitions. [2021-10-29 04:39:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 04:39:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:49,154 INFO L225 Difference]: With dead ends: 387 [2021-10-29 04:39:49,154 INFO L226 Difference]: Without dead ends: 364 [2021-10-29 04:39:49,155 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-29 04:39:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-10-29 04:39:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 355 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 483 transitions. [2021-10-29 04:39:49,199 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 483 transitions. Word has length 10 [2021-10-29 04:39:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:49,199 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 483 transitions. [2021-10-29 04:39:49,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 483 transitions. [2021-10-29 04:39:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:39:49,201 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:49,201 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:49,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:39:49,202 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -241979124, now seen corresponding path program 1 times [2021-10-29 04:39:49,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:49,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898092038] [2021-10-29 04:39:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:49,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:49,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:49,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898092038] [2021-10-29 04:39:49,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898092038] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:49,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:49,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:49,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802148504] [2021-10-29 04:39:49,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:49,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,314 INFO L87 Difference]: Start difference. First operand 356 states and 483 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:49,357 INFO L93 Difference]: Finished difference Result 437 states and 584 transitions. [2021-10-29 04:39:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-29 04:39:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:49,361 INFO L225 Difference]: With dead ends: 437 [2021-10-29 04:39:49,361 INFO L226 Difference]: Without dead ends: 400 [2021-10-29 04:39:49,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-10-29 04:39:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2021-10-29 04:39:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 350 states have (on average 1.4885714285714287) internal successors, (521), 381 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 521 transitions. [2021-10-29 04:39:49,380 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 521 transitions. Word has length 11 [2021-10-29 04:39:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:49,381 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 521 transitions. [2021-10-29 04:39:49,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 521 transitions. [2021-10-29 04:39:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:39:49,382 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:49,382 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:49,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:39:49,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 576658662, now seen corresponding path program 1 times [2021-10-29 04:39:49,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:49,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4338885] [2021-10-29 04:39:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:49,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:49,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:49,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4338885] [2021-10-29 04:39:49,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4338885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:49,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:49,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:49,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240271079] [2021-10-29 04:39:49,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:49,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,439 INFO L87 Difference]: Start difference. First operand 382 states and 521 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:49,500 INFO L93 Difference]: Finished difference Result 629 states and 840 transitions. [2021-10-29 04:39:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:39:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:49,503 INFO L225 Difference]: With dead ends: 629 [2021-10-29 04:39:49,504 INFO L226 Difference]: Without dead ends: 444 [2021-10-29 04:39:49,505 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-29 04:39:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 360. [2021-10-29 04:39:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.4408284023668638) internal successors, (487), 359 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 487 transitions. [2021-10-29 04:39:49,526 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 487 transitions. Word has length 12 [2021-10-29 04:39:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:49,526 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 487 transitions. [2021-10-29 04:39:49,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 487 transitions. [2021-10-29 04:39:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:39:49,528 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:49,528 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:49,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:39:49,529 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1121678930, now seen corresponding path program 1 times [2021-10-29 04:39:49,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:49,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141953253] [2021-10-29 04:39:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:49,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:49,565 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:49,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141953253] [2021-10-29 04:39:49,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141953253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:49,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:49,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:49,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954639913] [2021-10-29 04:39:49,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:49,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:49,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:49,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,568 INFO L87 Difference]: Start difference. First operand 360 states and 487 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:49,740 INFO L93 Difference]: Finished difference Result 393 states and 527 transitions. [2021-10-29 04:39:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-29 04:39:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:49,743 INFO L225 Difference]: With dead ends: 393 [2021-10-29 04:39:49,743 INFO L226 Difference]: Without dead ends: 375 [2021-10-29 04:39:49,743 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-10-29 04:39:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2021-10-29 04:39:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 350 states have (on average 1.4314285714285715) internal successors, (501), 371 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 501 transitions. [2021-10-29 04:39:49,764 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 501 transitions. Word has length 14 [2021-10-29 04:39:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:49,765 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 501 transitions. [2021-10-29 04:39:49,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 501 transitions. [2021-10-29 04:39:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 04:39:49,767 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:49,767 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:49,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:39:49,767 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1731769240, now seen corresponding path program 1 times [2021-10-29 04:39:49,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:49,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185296516] [2021-10-29 04:39:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:49,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:49,815 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:49,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185296516] [2021-10-29 04:39:49,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185296516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:49,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:49,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:49,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784039101] [2021-10-29 04:39:49,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:49,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:49,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,817 INFO L87 Difference]: Start difference. First operand 372 states and 501 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:49,975 INFO L93 Difference]: Finished difference Result 372 states and 501 transitions. [2021-10-29 04:39:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 04:39:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:49,978 INFO L225 Difference]: With dead ends: 372 [2021-10-29 04:39:49,978 INFO L226 Difference]: Without dead ends: 356 [2021-10-29 04:39:49,979 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-29 04:39:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-10-29 04:39:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 342 states have (on average 1.4152046783625731) internal successors, (484), 355 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 484 transitions. [2021-10-29 04:39:50,000 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 484 transitions. Word has length 17 [2021-10-29 04:39:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:50,001 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 484 transitions. [2021-10-29 04:39:50,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 484 transitions. [2021-10-29 04:39:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:39:50,004 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:50,004 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:50,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:39:50,004 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash -313015571, now seen corresponding path program 1 times [2021-10-29 04:39:50,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:50,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358441726] [2021-10-29 04:39:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:50,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:50,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:50,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358441726] [2021-10-29 04:39:50,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358441726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:50,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:50,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:39:50,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478913113] [2021-10-29 04:39:50,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:50,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:50,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:50,072 INFO L87 Difference]: Start difference. First operand 356 states and 484 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:50,121 INFO L93 Difference]: Finished difference Result 443 states and 579 transitions. [2021-10-29 04:39:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 04:39:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:50,124 INFO L225 Difference]: With dead ends: 443 [2021-10-29 04:39:50,124 INFO L226 Difference]: Without dead ends: 407 [2021-10-29 04:39:50,125 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-29 04:39:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 343. [2021-10-29 04:39:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 329 states have (on average 1.4103343465045592) internal successors, (464), 342 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 464 transitions. [2021-10-29 04:39:50,148 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 464 transitions. Word has length 19 [2021-10-29 04:39:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:50,149 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 464 transitions. [2021-10-29 04:39:50,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 464 transitions. [2021-10-29 04:39:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 04:39:50,150 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:50,151 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:50,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:39:50,151 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -864042709, now seen corresponding path program 1 times [2021-10-29 04:39:50,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:50,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249467640] [2021-10-29 04:39:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:50,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:50,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:50,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249467640] [2021-10-29 04:39:50,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249467640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:50,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:50,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:50,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27620111] [2021-10-29 04:39:50,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:50,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:50,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:50,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:50,229 INFO L87 Difference]: Start difference. First operand 343 states and 464 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:50,344 INFO L93 Difference]: Finished difference Result 443 states and 597 transitions. [2021-10-29 04:39:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 04:39:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:50,347 INFO L225 Difference]: With dead ends: 443 [2021-10-29 04:39:50,347 INFO L226 Difference]: Without dead ends: 340 [2021-10-29 04:39:50,347 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-29 04:39:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-10-29 04:39:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 339 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 460 transitions. [2021-10-29 04:39:50,377 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 460 transitions. Word has length 20 [2021-10-29 04:39:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:50,378 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 460 transitions. [2021-10-29 04:39:50,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 460 transitions. [2021-10-29 04:39:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 04:39:50,379 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:50,379 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:50,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:39:50,380 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1111820266, now seen corresponding path program 1 times [2021-10-29 04:39:50,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:50,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050574412] [2021-10-29 04:39:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:50,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:50,484 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:50,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050574412] [2021-10-29 04:39:50,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050574412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:50,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:50,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:50,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720476375] [2021-10-29 04:39:50,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:50,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:50,487 INFO L87 Difference]: Start difference. First operand 340 states and 460 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:50,642 INFO L93 Difference]: Finished difference Result 352 states and 470 transitions. [2021-10-29 04:39:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 04:39:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:50,645 INFO L225 Difference]: With dead ends: 352 [2021-10-29 04:39:50,645 INFO L226 Difference]: Without dead ends: 343 [2021-10-29 04:39:50,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-29 04:39:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2021-10-29 04:39:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.396341463414634) internal successors, (458), 339 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 458 transitions. [2021-10-29 04:39:50,676 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 458 transitions. Word has length 20 [2021-10-29 04:39:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:50,677 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 458 transitions. [2021-10-29 04:39:50,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 458 transitions. [2021-10-29 04:39:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 04:39:50,678 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:50,679 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:50,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:39:50,679 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1090113680, now seen corresponding path program 1 times [2021-10-29 04:39:50,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:50,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774428750] [2021-10-29 04:39:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:50,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:50,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:50,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774428750] [2021-10-29 04:39:50,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774428750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:50,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:50,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:50,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504543339] [2021-10-29 04:39:50,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:50,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:50,737 INFO L87 Difference]: Start difference. First operand 340 states and 458 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:50,780 INFO L93 Difference]: Finished difference Result 433 states and 570 transitions. [2021-10-29 04:39:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 04:39:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:50,783 INFO L225 Difference]: With dead ends: 433 [2021-10-29 04:39:50,783 INFO L226 Difference]: Without dead ends: 338 [2021-10-29 04:39:50,783 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-29 04:39:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 324. [2021-10-29 04:39:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 312 states have (on average 1.3814102564102564) internal successors, (431), 323 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2021-10-29 04:39:50,810 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 21 [2021-10-29 04:39:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:50,812 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2021-10-29 04:39:50,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2021-10-29 04:39:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 04:39:50,814 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:50,814 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:50,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:39:50,815 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:50,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -639651721, now seen corresponding path program 1 times [2021-10-29 04:39:50,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:50,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469086900] [2021-10-29 04:39:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:50,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:50,877 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:50,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469086900] [2021-10-29 04:39:50,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469086900] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:50,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:50,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:50,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694685591] [2021-10-29 04:39:50,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:50,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:50,881 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,037 INFO L93 Difference]: Finished difference Result 336 states and 441 transitions. [2021-10-29 04:39:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:51,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 04:39:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,040 INFO L225 Difference]: With dead ends: 336 [2021-10-29 04:39:51,040 INFO L226 Difference]: Without dead ends: 327 [2021-10-29 04:39:51,040 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-29 04:39:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2021-10-29 04:39:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 312 states have (on average 1.375) internal successors, (429), 323 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 429 transitions. [2021-10-29 04:39:51,064 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 429 transitions. Word has length 21 [2021-10-29 04:39:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,064 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 429 transitions. [2021-10-29 04:39:51,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 429 transitions. [2021-10-29 04:39:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 04:39:51,066 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,066 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:39:51,066 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 530749217, now seen corresponding path program 1 times [2021-10-29 04:39:51,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982359336] [2021-10-29 04:39:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,095 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982359336] [2021-10-29 04:39:51,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982359336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:51,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130240689] [2021-10-29 04:39:51,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:51,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:51,098 INFO L87 Difference]: Start difference. First operand 324 states and 429 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,134 INFO L93 Difference]: Finished difference Result 355 states and 463 transitions. [2021-10-29 04:39:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 04:39:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,137 INFO L225 Difference]: With dead ends: 355 [2021-10-29 04:39:51,137 INFO L226 Difference]: Without dead ends: 320 [2021-10-29 04:39:51,138 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-10-29 04:39:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2021-10-29 04:39:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 316 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 414 transitions. [2021-10-29 04:39:51,161 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 414 transitions. Word has length 21 [2021-10-29 04:39:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,162 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 414 transitions. [2021-10-29 04:39:51,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 414 transitions. [2021-10-29 04:39:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:39:51,163 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:39:51,164 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -323328037, now seen corresponding path program 1 times [2021-10-29 04:39:51,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113953143] [2021-10-29 04:39:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113953143] [2021-10-29 04:39:51,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113953143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:51,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488988396] [2021-10-29 04:39:51,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:51,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:51,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:51,195 INFO L87 Difference]: Start difference. First operand 317 states and 414 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,339 INFO L93 Difference]: Finished difference Result 368 states and 477 transitions. [2021-10-29 04:39:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 04:39:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,343 INFO L225 Difference]: With dead ends: 368 [2021-10-29 04:39:51,343 INFO L226 Difference]: Without dead ends: 360 [2021-10-29 04:39:51,343 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-10-29 04:39:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 325. [2021-10-29 04:39:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.3610223642172523) internal successors, (426), 324 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 426 transitions. [2021-10-29 04:39:51,367 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 426 transitions. Word has length 22 [2021-10-29 04:39:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,367 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 426 transitions. [2021-10-29 04:39:51,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 426 transitions. [2021-10-29 04:39:51,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:39:51,371 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,371 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 04:39:51,372 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1281675629, now seen corresponding path program 1 times [2021-10-29 04:39:51,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784443588] [2021-10-29 04:39:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,437 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784443588] [2021-10-29 04:39:51,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784443588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:39:51,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344996481] [2021-10-29 04:39:51,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:51,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:51,439 INFO L87 Difference]: Start difference. First operand 325 states and 426 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,482 INFO L93 Difference]: Finished difference Result 338 states and 438 transitions. [2021-10-29 04:39:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 04:39:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,484 INFO L225 Difference]: With dead ends: 338 [2021-10-29 04:39:51,485 INFO L226 Difference]: Without dead ends: 323 [2021-10-29 04:39:51,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-29 04:39:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-10-29 04:39:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.360128617363344) internal successors, (423), 322 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 423 transitions. [2021-10-29 04:39:51,509 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 423 transitions. Word has length 22 [2021-10-29 04:39:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,511 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 423 transitions. [2021-10-29 04:39:51,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 423 transitions. [2021-10-29 04:39:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:39:51,513 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 04:39:51,514 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1767458916, now seen corresponding path program 1 times [2021-10-29 04:39:51,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104811601] [2021-10-29 04:39:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104811601] [2021-10-29 04:39:51,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104811601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:39:51,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152133229] [2021-10-29 04:39:51,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:51,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:51,590 INFO L87 Difference]: Start difference. First operand 323 states and 423 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,642 INFO L93 Difference]: Finished difference Result 361 states and 462 transitions. [2021-10-29 04:39:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 04:39:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,645 INFO L225 Difference]: With dead ends: 361 [2021-10-29 04:39:51,645 INFO L226 Difference]: Without dead ends: 340 [2021-10-29 04:39:51,647 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-29 04:39:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 325. [2021-10-29 04:39:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.3578274760383386) internal successors, (425), 324 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 425 transitions. [2021-10-29 04:39:51,670 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 425 transitions. Word has length 22 [2021-10-29 04:39:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,670 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 425 transitions. [2021-10-29 04:39:51,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2021-10-29 04:39:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:39:51,672 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,672 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 04:39:51,673 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1677636943, now seen corresponding path program 1 times [2021-10-29 04:39:51,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047039853] [2021-10-29 04:39:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047039853] [2021-10-29 04:39:51,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047039853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:39:51,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783347741] [2021-10-29 04:39:51,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:51,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:51,729 INFO L87 Difference]: Start difference. First operand 325 states and 425 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:51,774 INFO L93 Difference]: Finished difference Result 338 states and 437 transitions. [2021-10-29 04:39:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 04:39:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:51,777 INFO L225 Difference]: With dead ends: 338 [2021-10-29 04:39:51,777 INFO L226 Difference]: Without dead ends: 323 [2021-10-29 04:39:51,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-29 04:39:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-10-29 04:39:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.3569131832797428) internal successors, (422), 322 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2021-10-29 04:39:51,799 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 22 [2021-10-29 04:39:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:51,799 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2021-10-29 04:39:51,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2021-10-29 04:39:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 04:39:51,801 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:51,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:51,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 04:39:51,801 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1440892488, now seen corresponding path program 1 times [2021-10-29 04:39:51,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:51,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769980047] [2021-10-29 04:39:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:51,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:51,842 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:51,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769980047] [2021-10-29 04:39:51,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769980047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:51,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:51,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:51,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55215488] [2021-10-29 04:39:51,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:51,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:51,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:51,845 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,019 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2021-10-29 04:39:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:52,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 04:39:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,022 INFO L225 Difference]: With dead ends: 369 [2021-10-29 04:39:52,022 INFO L226 Difference]: Without dead ends: 338 [2021-10-29 04:39:52,023 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-29 04:39:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 318. [2021-10-29 04:39:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 307 states have (on average 1.3485342019543973) internal successors, (414), 317 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 414 transitions. [2021-10-29 04:39:52,048 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 414 transitions. Word has length 23 [2021-10-29 04:39:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,048 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 414 transitions. [2021-10-29 04:39:52,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 414 transitions. [2021-10-29 04:39:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 04:39:52,050 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,050 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 04:39:52,050 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2038196278, now seen corresponding path program 1 times [2021-10-29 04:39:52,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279034847] [2021-10-29 04:39:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:52,084 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:52,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279034847] [2021-10-29 04:39:52,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279034847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:52,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:52,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:52,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693814026] [2021-10-29 04:39:52,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:52,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,086 INFO L87 Difference]: Start difference. First operand 318 states and 414 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,126 INFO L93 Difference]: Finished difference Result 435 states and 556 transitions. [2021-10-29 04:39:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:52,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 04:39:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,129 INFO L225 Difference]: With dead ends: 435 [2021-10-29 04:39:52,129 INFO L226 Difference]: Without dead ends: 341 [2021-10-29 04:39:52,130 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-29 04:39:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 306. [2021-10-29 04:39:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.3288590604026846) internal successors, (396), 305 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2021-10-29 04:39:52,175 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 23 [2021-10-29 04:39:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,175 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2021-10-29 04:39:52,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2021-10-29 04:39:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:39:52,177 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,177 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 04:39:52,177 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 379424731, now seen corresponding path program 1 times [2021-10-29 04:39:52,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658383089] [2021-10-29 04:39:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:52,277 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:52,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658383089] [2021-10-29 04:39:52,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658383089] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:52,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:52,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:52,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035248946] [2021-10-29 04:39:52,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:52,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:52,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,279 INFO L87 Difference]: Start difference. First operand 306 states and 396 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,336 INFO L93 Difference]: Finished difference Result 406 states and 518 transitions. [2021-10-29 04:39:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:39:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,339 INFO L225 Difference]: With dead ends: 406 [2021-10-29 04:39:52,339 INFO L226 Difference]: Without dead ends: 308 [2021-10-29 04:39:52,340 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-29 04:39:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2021-10-29 04:39:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 287 states have (on average 1.3170731707317074) internal successors, (378), 293 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 378 transitions. [2021-10-29 04:39:52,369 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 378 transitions. Word has length 24 [2021-10-29 04:39:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,369 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 378 transitions. [2021-10-29 04:39:52,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 378 transitions. [2021-10-29 04:39:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:39:52,371 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,371 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 04:39:52,371 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -414714960, now seen corresponding path program 1 times [2021-10-29 04:39:52,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768081915] [2021-10-29 04:39:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:52,405 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:52,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768081915] [2021-10-29 04:39:52,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768081915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:52,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:52,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:52,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031358137] [2021-10-29 04:39:52,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:52,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:52,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,407 INFO L87 Difference]: Start difference. First operand 294 states and 378 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,542 INFO L93 Difference]: Finished difference Result 392 states and 492 transitions. [2021-10-29 04:39:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:39:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,546 INFO L225 Difference]: With dead ends: 392 [2021-10-29 04:39:52,546 INFO L226 Difference]: Without dead ends: 379 [2021-10-29 04:39:52,546 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-10-29 04:39:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 321. [2021-10-29 04:39:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 314 states have (on average 1.2961783439490446) internal successors, (407), 320 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 407 transitions. [2021-10-29 04:39:52,578 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 407 transitions. Word has length 24 [2021-10-29 04:39:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,578 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 407 transitions. [2021-10-29 04:39:52,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 407 transitions. [2021-10-29 04:39:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 04:39:52,579 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,579 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 04:39:52,580 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,580 INFO L85 PathProgramCache]: Analyzing trace with hash 707855854, now seen corresponding path program 1 times [2021-10-29 04:39:52,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76955352] [2021-10-29 04:39:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:52,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:52,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76955352] [2021-10-29 04:39:52,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76955352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:52,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:52,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:52,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659002623] [2021-10-29 04:39:52,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:52,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:52,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:52,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:52,622 INFO L87 Difference]: Start difference. First operand 321 states and 407 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,690 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2021-10-29 04:39:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:52,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-29 04:39:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,693 INFO L225 Difference]: With dead ends: 334 [2021-10-29 04:39:52,693 INFO L226 Difference]: Without dead ends: 317 [2021-10-29 04:39:52,694 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-29 04:39:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-10-29 04:39:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2967741935483872) internal successors, (402), 316 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 402 transitions. [2021-10-29 04:39:52,725 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 402 transitions. Word has length 24 [2021-10-29 04:39:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,726 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 402 transitions. [2021-10-29 04:39:52,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 402 transitions. [2021-10-29 04:39:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:39:52,727 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,727 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 04:39:52,728 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash -152605085, now seen corresponding path program 1 times [2021-10-29 04:39:52,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510751422] [2021-10-29 04:39:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:52,770 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:52,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510751422] [2021-10-29 04:39:52,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510751422] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:52,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:52,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:52,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61493363] [2021-10-29 04:39:52,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:52,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:52,772 INFO L87 Difference]: Start difference. First operand 317 states and 402 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:52,942 INFO L93 Difference]: Finished difference Result 403 states and 509 transitions. [2021-10-29 04:39:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:39:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:52,945 INFO L225 Difference]: With dead ends: 403 [2021-10-29 04:39:52,945 INFO L226 Difference]: Without dead ends: 317 [2021-10-29 04:39:52,946 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-29 04:39:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-10-29 04:39:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2870967741935484) internal successors, (399), 316 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 399 transitions. [2021-10-29 04:39:52,977 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 399 transitions. Word has length 25 [2021-10-29 04:39:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:52,978 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 399 transitions. [2021-10-29 04:39:52,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 399 transitions. [2021-10-29 04:39:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:39:52,979 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:52,979 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:52,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 04:39:52,980 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 46329818, now seen corresponding path program 1 times [2021-10-29 04:39:52,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:52,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344607755] [2021-10-29 04:39:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:52,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:53,018 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:53,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344607755] [2021-10-29 04:39:53,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344607755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:53,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:53,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:53,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352442945] [2021-10-29 04:39:53,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:53,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:53,020 INFO L87 Difference]: Start difference. First operand 317 states and 399 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:53,188 INFO L93 Difference]: Finished difference Result 375 states and 459 transitions. [2021-10-29 04:39:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:39:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:53,191 INFO L225 Difference]: With dead ends: 375 [2021-10-29 04:39:53,191 INFO L226 Difference]: Without dead ends: 372 [2021-10-29 04:39:53,191 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-29 04:39:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 330. [2021-10-29 04:39:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 323 states have (on average 1.284829721362229) internal successors, (415), 329 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 415 transitions. [2021-10-29 04:39:53,226 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 415 transitions. Word has length 25 [2021-10-29 04:39:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:53,226 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 415 transitions. [2021-10-29 04:39:53,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 415 transitions. [2021-10-29 04:39:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:39:53,227 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:53,227 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:53,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 04:39:53,228 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 46317902, now seen corresponding path program 1 times [2021-10-29 04:39:53,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:53,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061325194] [2021-10-29 04:39:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:53,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:53,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:53,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061325194] [2021-10-29 04:39:53,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061325194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:53,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:53,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:53,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272627270] [2021-10-29 04:39:53,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:53,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:53,275 INFO L87 Difference]: Start difference. First operand 330 states and 415 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:53,421 INFO L93 Difference]: Finished difference Result 341 states and 425 transitions. [2021-10-29 04:39:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:39:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:53,423 INFO L225 Difference]: With dead ends: 341 [2021-10-29 04:39:53,423 INFO L226 Difference]: Without dead ends: 327 [2021-10-29 04:39:53,424 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-29 04:39:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2021-10-29 04:39:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2784810126582278) internal successors, (404), 322 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 404 transitions. [2021-10-29 04:39:53,458 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 404 transitions. Word has length 25 [2021-10-29 04:39:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:53,458 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 404 transitions. [2021-10-29 04:39:53,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 404 transitions. [2021-10-29 04:39:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 04:39:53,459 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:53,460 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:53,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 04:39:53,460 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -884415984, now seen corresponding path program 1 times [2021-10-29 04:39:53,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:53,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779117059] [2021-10-29 04:39:53,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:53,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:53,501 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:53,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779117059] [2021-10-29 04:39:53,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779117059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:53,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:53,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:53,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769641030] [2021-10-29 04:39:53,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:53,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:53,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:53,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:53,503 INFO L87 Difference]: Start difference. First operand 323 states and 404 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:53,659 INFO L93 Difference]: Finished difference Result 376 states and 461 transitions. [2021-10-29 04:39:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 04:39:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:53,662 INFO L225 Difference]: With dead ends: 376 [2021-10-29 04:39:53,662 INFO L226 Difference]: Without dead ends: 323 [2021-10-29 04:39:53,662 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-10-29 04:39:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-10-29 04:39:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2531645569620253) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-10-29 04:39:53,728 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 25 [2021-10-29 04:39:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:53,729 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-10-29 04:39:53,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-10-29 04:39:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:39:53,730 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:53,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:53,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 04:39:53,731 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1255429665, now seen corresponding path program 1 times [2021-10-29 04:39:53,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:53,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96397294] [2021-10-29 04:39:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:53,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:53,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:53,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96397294] [2021-10-29 04:39:53,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96397294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:53,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:53,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:53,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977899507] [2021-10-29 04:39:53,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:53,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:53,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:53,802 INFO L87 Difference]: Start difference. First operand 323 states and 396 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:54,077 INFO L93 Difference]: Finished difference Result 377 states and 462 transitions. [2021-10-29 04:39:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 04:39:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:54,079 INFO L225 Difference]: With dead ends: 377 [2021-10-29 04:39:54,079 INFO L226 Difference]: Without dead ends: 373 [2021-10-29 04:39:54,080 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-10-29 04:39:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 323. [2021-10-29 04:39:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2531645569620253) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-10-29 04:39:54,141 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 26 [2021-10-29 04:39:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:54,141 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-10-29 04:39:54,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-10-29 04:39:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:39:54,142 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:54,143 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:54,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 04:39:54,143 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1808181060, now seen corresponding path program 1 times [2021-10-29 04:39:54,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:54,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638579990] [2021-10-29 04:39:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:54,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:54,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:54,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638579990] [2021-10-29 04:39:54,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638579990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:54,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:54,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:39:54,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920755444] [2021-10-29 04:39:54,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:39:54,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:54,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:39:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:54,247 INFO L87 Difference]: Start difference. First operand 323 states and 396 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:54,421 INFO L93 Difference]: Finished difference Result 369 states and 441 transitions. [2021-10-29 04:39:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:39:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 04:39:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:54,424 INFO L225 Difference]: With dead ends: 369 [2021-10-29 04:39:54,424 INFO L226 Difference]: Without dead ends: 351 [2021-10-29 04:39:54,425 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:39:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-10-29 04:39:54,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 317. [2021-10-29 04:39:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2225806451612904) internal successors, (379), 316 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 379 transitions. [2021-10-29 04:39:54,471 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 379 transitions. Word has length 26 [2021-10-29 04:39:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:54,471 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 379 transitions. [2021-10-29 04:39:54,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 379 transitions. [2021-10-29 04:39:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 04:39:54,473 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:54,473 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:54,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 04:39:54,474 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1624180011, now seen corresponding path program 1 times [2021-10-29 04:39:54,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:54,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228684027] [2021-10-29 04:39:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:54,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:54,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:54,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228684027] [2021-10-29 04:39:54,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228684027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:54,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:54,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:54,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965932825] [2021-10-29 04:39:54,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:54,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:54,508 INFO L87 Difference]: Start difference. First operand 317 states and 379 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:54,623 INFO L93 Difference]: Finished difference Result 354 states and 412 transitions. [2021-10-29 04:39:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-29 04:39:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:54,626 INFO L225 Difference]: With dead ends: 354 [2021-10-29 04:39:54,627 INFO L226 Difference]: Without dead ends: 333 [2021-10-29 04:39:54,627 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-10-29 04:39:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2021-10-29 04:39:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 312 states have (on average 1.2083333333333333) internal successors, (377), 318 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 377 transitions. [2021-10-29 04:39:54,667 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 377 transitions. Word has length 26 [2021-10-29 04:39:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:54,667 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 377 transitions. [2021-10-29 04:39:54,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 377 transitions. [2021-10-29 04:39:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 04:39:54,668 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:54,669 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:54,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 04:39:54,669 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1207606985, now seen corresponding path program 1 times [2021-10-29 04:39:54,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:54,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139895750] [2021-10-29 04:39:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:54,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:54,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:54,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139895750] [2021-10-29 04:39:54,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139895750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:54,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:54,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:54,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022247084] [2021-10-29 04:39:54,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:54,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:54,720 INFO L87 Difference]: Start difference. First operand 319 states and 377 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:54,879 INFO L93 Difference]: Finished difference Result 330 states and 386 transitions. [2021-10-29 04:39:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-29 04:39:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:54,881 INFO L225 Difference]: With dead ends: 330 [2021-10-29 04:39:54,882 INFO L226 Difference]: Without dead ends: 301 [2021-10-29 04:39:54,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-29 04:39:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2021-10-29 04:39:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2167832167832169) internal successors, (348), 292 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 348 transitions. [2021-10-29 04:39:54,922 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 348 transitions. Word has length 27 [2021-10-29 04:39:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:54,923 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 348 transitions. [2021-10-29 04:39:54,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 348 transitions. [2021-10-29 04:39:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 04:39:54,924 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:54,924 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:54,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 04:39:54,925 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -890975267, now seen corresponding path program 1 times [2021-10-29 04:39:54,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:54,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194351187] [2021-10-29 04:39:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:54,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:54,969 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:54,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194351187] [2021-10-29 04:39:54,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194351187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:54,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:54,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:54,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199273606] [2021-10-29 04:39:54,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:54,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:54,971 INFO L87 Difference]: Start difference. First operand 293 states and 348 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:55,101 INFO L93 Difference]: Finished difference Result 311 states and 362 transitions. [2021-10-29 04:39:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:55,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-29 04:39:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:55,103 INFO L225 Difference]: With dead ends: 311 [2021-10-29 04:39:55,103 INFO L226 Difference]: Without dead ends: 302 [2021-10-29 04:39:55,104 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-29 04:39:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 293. [2021-10-29 04:39:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2097902097902098) internal successors, (346), 292 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 346 transitions. [2021-10-29 04:39:55,143 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 346 transitions. Word has length 28 [2021-10-29 04:39:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:55,143 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 346 transitions. [2021-10-29 04:39:55,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 346 transitions. [2021-10-29 04:39:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 04:39:55,144 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:55,145 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:55,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 04:39:55,145 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash 476096558, now seen corresponding path program 1 times [2021-10-29 04:39:55,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:55,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766409191] [2021-10-29 04:39:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:55,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:55,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:55,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766409191] [2021-10-29 04:39:55,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766409191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:55,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:55,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:55,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721420129] [2021-10-29 04:39:55,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:55,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:55,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:55,202 INFO L87 Difference]: Start difference. First operand 293 states and 346 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:55,434 INFO L93 Difference]: Finished difference Result 323 states and 380 transitions. [2021-10-29 04:39:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-29 04:39:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:55,437 INFO L225 Difference]: With dead ends: 323 [2021-10-29 04:39:55,437 INFO L226 Difference]: Without dead ends: 321 [2021-10-29 04:39:55,437 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-29 04:39:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 293. [2021-10-29 04:39:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2097902097902098) internal successors, (346), 292 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 346 transitions. [2021-10-29 04:39:55,475 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 346 transitions. Word has length 28 [2021-10-29 04:39:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:55,475 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 346 transitions. [2021-10-29 04:39:55,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 346 transitions. [2021-10-29 04:39:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 04:39:55,476 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:55,476 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:55,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 04:39:55,477 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:55,478 INFO L85 PathProgramCache]: Analyzing trace with hash -371771776, now seen corresponding path program 1 times [2021-10-29 04:39:55,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:55,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075242041] [2021-10-29 04:39:55,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:55,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:55,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:55,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075242041] [2021-10-29 04:39:55,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075242041] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:55,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:55,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:55,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460982127] [2021-10-29 04:39:55,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:55,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:55,519 INFO L87 Difference]: Start difference. First operand 293 states and 346 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:55,606 INFO L93 Difference]: Finished difference Result 320 states and 371 transitions. [2021-10-29 04:39:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:55,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 04:39:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:55,608 INFO L225 Difference]: With dead ends: 320 [2021-10-29 04:39:55,608 INFO L226 Difference]: Without dead ends: 303 [2021-10-29 04:39:55,609 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-29 04:39:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 290. [2021-10-29 04:39:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 289 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2021-10-29 04:39:55,645 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 29 [2021-10-29 04:39:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:55,646 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2021-10-29 04:39:55,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2021-10-29 04:39:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 04:39:55,647 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:55,647 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:55,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 04:39:55,648 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1911218472, now seen corresponding path program 1 times [2021-10-29 04:39:55,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:55,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782221683] [2021-10-29 04:39:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:55,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:55,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:55,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782221683] [2021-10-29 04:39:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782221683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:55,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:55,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:55,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859989007] [2021-10-29 04:39:55,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:55,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:55,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:55,680 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:55,826 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2021-10-29 04:39:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 04:39:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:55,829 INFO L225 Difference]: With dead ends: 299 [2021-10-29 04:39:55,829 INFO L226 Difference]: Without dead ends: 266 [2021-10-29 04:39:55,829 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-29 04:39:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-29 04:39:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 259 states have (on average 1.196911196911197) internal successors, (310), 265 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 310 transitions. [2021-10-29 04:39:55,864 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 310 transitions. Word has length 29 [2021-10-29 04:39:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:55,864 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 310 transitions. [2021-10-29 04:39:55,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 310 transitions. [2021-10-29 04:39:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 04:39:55,865 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:55,865 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:55,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 04:39:55,866 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash -502736061, now seen corresponding path program 1 times [2021-10-29 04:39:55,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:55,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146396726] [2021-10-29 04:39:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:55,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:55,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:55,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146396726] [2021-10-29 04:39:55,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146396726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:55,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:55,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:55,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092686435] [2021-10-29 04:39:55,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:55,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:55,904 INFO L87 Difference]: Start difference. First operand 266 states and 310 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:55,970 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2021-10-29 04:39:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-29 04:39:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:55,973 INFO L225 Difference]: With dead ends: 290 [2021-10-29 04:39:55,973 INFO L226 Difference]: Without dead ends: 266 [2021-10-29 04:39:55,973 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-29 04:39:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-10-29 04:39:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 259 states have (on average 1.193050193050193) internal successors, (309), 265 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 309 transitions. [2021-10-29 04:39:56,006 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 309 transitions. Word has length 29 [2021-10-29 04:39:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:56,007 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 309 transitions. [2021-10-29 04:39:56,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 309 transitions. [2021-10-29 04:39:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 04:39:56,008 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:56,008 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:56,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 04:39:56,009 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 96845592, now seen corresponding path program 1 times [2021-10-29 04:39:56,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:56,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302768339] [2021-10-29 04:39:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:56,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:56,059 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:56,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302768339] [2021-10-29 04:39:56,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302768339] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:56,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:56,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:56,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362621543] [2021-10-29 04:39:56,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:56,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:56,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:56,061 INFO L87 Difference]: Start difference. First operand 266 states and 309 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:56,208 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2021-10-29 04:39:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 04:39:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:56,211 INFO L225 Difference]: With dead ends: 291 [2021-10-29 04:39:56,211 INFO L226 Difference]: Without dead ends: 272 [2021-10-29 04:39:56,211 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-29 04:39:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 258. [2021-10-29 04:39:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 251 states have (on average 1.1952191235059761) internal successors, (300), 257 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2021-10-29 04:39:56,245 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 30 [2021-10-29 04:39:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:56,246 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2021-10-29 04:39:56,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2021-10-29 04:39:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-29 04:39:56,247 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:56,247 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:56,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 04:39:56,247 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1912192022, now seen corresponding path program 1 times [2021-10-29 04:39:56,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:56,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077438059] [2021-10-29 04:39:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:56,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:56,308 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:56,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077438059] [2021-10-29 04:39:56,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077438059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:56,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:56,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:56,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521475918] [2021-10-29 04:39:56,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:56,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:56,310 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:56,482 INFO L93 Difference]: Finished difference Result 334 states and 395 transitions. [2021-10-29 04:39:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-29 04:39:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:56,484 INFO L225 Difference]: With dead ends: 334 [2021-10-29 04:39:56,484 INFO L226 Difference]: Without dead ends: 266 [2021-10-29 04:39:56,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-29 04:39:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2021-10-29 04:39:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 242 states have (on average 1.1859504132231404) internal successors, (287), 247 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-10-29 04:39:56,518 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 30 [2021-10-29 04:39:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:56,518 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-10-29 04:39:56,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-10-29 04:39:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-29 04:39:56,520 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:56,520 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:56,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 04:39:56,521 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -879337433, now seen corresponding path program 1 times [2021-10-29 04:39:56,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:56,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739255006] [2021-10-29 04:39:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:56,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:56,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:56,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739255006] [2021-10-29 04:39:56,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739255006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:56,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:56,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:56,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247340163] [2021-10-29 04:39:56,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:56,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:56,585 INFO L87 Difference]: Start difference. First operand 248 states and 287 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:56,645 INFO L93 Difference]: Finished difference Result 271 states and 307 transitions. [2021-10-29 04:39:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:56,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-29 04:39:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:56,647 INFO L225 Difference]: With dead ends: 271 [2021-10-29 04:39:56,647 INFO L226 Difference]: Without dead ends: 247 [2021-10-29 04:39:56,648 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-29 04:39:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 234. [2021-10-29 04:39:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.1746724890829694) internal successors, (269), 233 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 269 transitions. [2021-10-29 04:39:56,678 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 269 transitions. Word has length 31 [2021-10-29 04:39:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:56,678 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 269 transitions. [2021-10-29 04:39:56,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 269 transitions. [2021-10-29 04:39:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 04:39:56,679 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:56,679 INFO L513 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] [2021-10-29 04:39:56,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 04:39:56,680 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash -522752280, now seen corresponding path program 1 times [2021-10-29 04:39:56,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:56,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941956773] [2021-10-29 04:39:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:56,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:56,722 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:56,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941956773] [2021-10-29 04:39:56,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941956773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:56,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:56,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:56,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065013328] [2021-10-29 04:39:56,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:56,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:56,724 INFO L87 Difference]: Start difference. First operand 234 states and 269 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:56,876 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2021-10-29 04:39:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-29 04:39:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:56,878 INFO L225 Difference]: With dead ends: 266 [2021-10-29 04:39:56,879 INFO L226 Difference]: Without dead ends: 242 [2021-10-29 04:39:56,879 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-29 04:39:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 227. [2021-10-29 04:39:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 223 states have (on average 1.1659192825112108) internal successors, (260), 226 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2021-10-29 04:39:56,909 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 32 [2021-10-29 04:39:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:56,909 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2021-10-29 04:39:56,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2021-10-29 04:39:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 04:39:56,910 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:56,910 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:56,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-29 04:39:56,911 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1032708207, now seen corresponding path program 1 times [2021-10-29 04:39:56,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:56,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186983609] [2021-10-29 04:39:56,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:56,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:56,942 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:56,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186983609] [2021-10-29 04:39:56,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186983609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:56,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:56,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:39:56,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338442170] [2021-10-29 04:39:56,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:39:56,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:56,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:39:56,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:39:56,944 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:56,988 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2021-10-29 04:39:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:39:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-29 04:39:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:56,990 INFO L225 Difference]: With dead ends: 244 [2021-10-29 04:39:56,991 INFO L226 Difference]: Without dead ends: 228 [2021-10-29 04:39:56,991 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-29 04:39:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2021-10-29 04:39:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 220 states have (on average 1.1636363636363636) internal successors, (256), 223 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 256 transitions. [2021-10-29 04:39:57,022 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 256 transitions. Word has length 33 [2021-10-29 04:39:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,022 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 256 transitions. [2021-10-29 04:39:57,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2021-10-29 04:39:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 04:39:57,023 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-29 04:39:57,024 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1689083006, now seen corresponding path program 1 times [2021-10-29 04:39:57,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610702619] [2021-10-29 04:39:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:57,070 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:57,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610702619] [2021-10-29 04:39:57,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610702619] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:57,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:57,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:39:57,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642119628] [2021-10-29 04:39:57,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:39:57,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:57,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:39:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:57,072 INFO L87 Difference]: Start difference. First operand 224 states and 256 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:57,208 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2021-10-29 04:39:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:39:57,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-29 04:39:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:57,210 INFO L225 Difference]: With dead ends: 244 [2021-10-29 04:39:57,210 INFO L226 Difference]: Without dead ends: 198 [2021-10-29 04:39:57,211 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:39:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-29 04:39:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2021-10-29 04:39:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 177 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2021-10-29 04:39:57,235 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 33 [2021-10-29 04:39:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,235 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2021-10-29 04:39:57,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2021-10-29 04:39:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 04:39:57,236 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,237 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-29 04:39:57,237 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1905139186, now seen corresponding path program 1 times [2021-10-29 04:39:57,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728358371] [2021-10-29 04:39:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:57,288 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:57,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728358371] [2021-10-29 04:39:57,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728358371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:57,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:57,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:57,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877154421] [2021-10-29 04:39:57,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:57,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:57,290 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:57,435 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2021-10-29 04:39:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-29 04:39:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:57,437 INFO L225 Difference]: With dead ends: 210 [2021-10-29 04:39:57,437 INFO L226 Difference]: Without dead ends: 208 [2021-10-29 04:39:57,440 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-29 04:39:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 178. [2021-10-29 04:39:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 177 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2021-10-29 04:39:57,469 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 36 [2021-10-29 04:39:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,470 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2021-10-29 04:39:57,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2021-10-29 04:39:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 04:39:57,471 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,471 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-29 04:39:57,472 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1820777888, now seen corresponding path program 1 times [2021-10-29 04:39:57,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011125762] [2021-10-29 04:39:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:57,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:57,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011125762] [2021-10-29 04:39:57,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011125762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:57,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:57,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:57,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902855470] [2021-10-29 04:39:57,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:57,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:57,533 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:57,595 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2021-10-29 04:39:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-29 04:39:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:57,610 INFO L225 Difference]: With dead ends: 182 [2021-10-29 04:39:57,613 INFO L226 Difference]: Without dead ends: 137 [2021-10-29 04:39:57,613 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:39:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-29 04:39:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-29 04:39:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.171641791044776) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2021-10-29 04:39:57,640 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 37 [2021-10-29 04:39:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,641 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2021-10-29 04:39:57,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2021-10-29 04:39:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:39:57,642 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,642 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-29 04:39:57,643 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2024872774, now seen corresponding path program 1 times [2021-10-29 04:39:57,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344042720] [2021-10-29 04:39:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:57,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:57,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344042720] [2021-10-29 04:39:57,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344042720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:57,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:57,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:39:57,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548136768] [2021-10-29 04:39:57,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:39:57,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:39:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:57,691 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:57,774 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-10-29 04:39:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:39:57,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 04:39:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:57,776 INFO L225 Difference]: With dead ends: 153 [2021-10-29 04:39:57,776 INFO L226 Difference]: Without dead ends: 137 [2021-10-29 04:39:57,777 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:39:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-29 04:39:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-29 04:39:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.164179104477612) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2021-10-29 04:39:57,801 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 40 [2021-10-29 04:39:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,803 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2021-10-29 04:39:57,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2021-10-29 04:39:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:39:57,804 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,804 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-29 04:39:57,804 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1289584511, now seen corresponding path program 1 times [2021-10-29 04:39:57,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787194106] [2021-10-29 04:39:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:57,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:57,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787194106] [2021-10-29 04:39:57,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787194106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:57,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:57,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:39:57,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584169204] [2021-10-29 04:39:57,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:39:57,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:39:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:57,860 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:57,961 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2021-10-29 04:39:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:39:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 04:39:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:57,963 INFO L225 Difference]: With dead ends: 164 [2021-10-29 04:39:57,963 INFO L226 Difference]: Without dead ends: 146 [2021-10-29 04:39:57,964 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:39:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-29 04:39:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2021-10-29 04:39:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 143 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2021-10-29 04:39:57,988 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 40 [2021-10-29 04:39:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:57,988 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2021-10-29 04:39:57,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2021-10-29 04:39:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 04:39:57,989 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:57,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:39:57,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-29 04:39:57,990 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -890858384, now seen corresponding path program 1 times [2021-10-29 04:39:57,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:57,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138634441] [2021-10-29 04:39:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:57,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:58,045 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:58,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138634441] [2021-10-29 04:39:58,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138634441] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:58,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:58,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:39:58,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724231512] [2021-10-29 04:39:58,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:39:58,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:39:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:39:58,048 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:58,152 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-10-29 04:39:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:39:58,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-29 04:39:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:58,153 INFO L225 Difference]: With dead ends: 203 [2021-10-29 04:39:58,154 INFO L226 Difference]: Without dead ends: 151 [2021-10-29 04:39:58,154 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:39:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-29 04:39:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2021-10-29 04:39:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 121 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2021-10-29 04:39:58,175 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 40 [2021-10-29 04:39:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:58,175 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2021-10-29 04:39:58,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2021-10-29 04:39:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-29 04:39:58,176 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:58,176 INFO L513 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] [2021-10-29 04:39:58,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-29 04:39:58,177 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2019812524, now seen corresponding path program 1 times [2021-10-29 04:39:58,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:58,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067677593] [2021-10-29 04:39:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:58,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:39:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:39:58,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:39:58,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067677593] [2021-10-29 04:39:58,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067677593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:39:58,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:39:58,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:39:58,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097515303] [2021-10-29 04:39:58,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:39:58,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:39:58,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:39:58,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:58,204 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:39:58,233 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-10-29 04:39:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:39:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-29 04:39:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:39:58,235 INFO L225 Difference]: With dead ends: 158 [2021-10-29 04:39:58,235 INFO L226 Difference]: Without dead ends: 136 [2021-10-29 04:39:58,235 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:39:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-29 04:39:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2021-10-29 04:39:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.1) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2021-10-29 04:39:58,256 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 41 [2021-10-29 04:39:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:39:58,256 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-10-29 04:39:58,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:39:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2021-10-29 04:39:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 04:39:58,257 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:39:58,258 INFO L513 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] [2021-10-29 04:39:58,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-29 04:39:58,258 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-10-29 04:39:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:39:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 7149933, now seen corresponding path program 1 times [2021-10-29 04:39:58,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:39:58,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653198921] [2021-10-29 04:39:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:39:58,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:39:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:39:58,277 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:39:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:39:58,338 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 04:39:58,338 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:39:58,339 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:39:58,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-29 04:39:58,386 INFO L731 BasicCegarLoop]: Path program 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] [2021-10-29 04:39:58,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:39:58,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:39:58 BoogieIcfgContainer [2021-10-29 04:39:58,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:39:58,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:39:58,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:39:58,524 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:39:58,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:39:48" (3/4) ... [2021-10-29 04:39:58,526 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 04:39:58,651 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:39:58,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:39:58,653 INFO L168 Benchmark]: Toolchain (without parser) took 14262.81 ms. Allocated memory was 86.0 MB in the beginning and 385.9 MB in the end (delta: 299.9 MB). Free memory was 56.0 MB in the beginning and 318.2 MB in the end (delta: -262.1 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,653 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 86.0 MB. Free memory is still 54.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:39:58,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.62 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 55.8 MB in the beginning and 83.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.59 ms. Allocated memory is still 111.1 MB. Free memory was 83.9 MB in the beginning and 73.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,655 INFO L168 Benchmark]: Boogie Preprocessor took 115.57 ms. Allocated memory is still 111.1 MB. Free memory was 73.4 MB in the beginning and 66.4 MB in the end (delta: 7.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,655 INFO L168 Benchmark]: RCFGBuilder took 2943.60 ms. Allocated memory was 111.1 MB in the beginning and 186.6 MB in the end (delta: 75.5 MB). Free memory was 66.4 MB in the beginning and 103.6 MB in the end (delta: -37.3 MB). Peak memory consumption was 61.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,656 INFO L168 Benchmark]: TraceAbstraction took 10313.12 ms. Allocated memory was 186.6 MB in the beginning and 385.9 MB in the end (delta: 199.2 MB). Free memory was 103.6 MB in the beginning and 332.9 MB in the end (delta: -229.2 MB). Peak memory consumption was 185.0 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,657 INFO L168 Benchmark]: Witness Printer took 128.32 ms. Allocated memory is still 385.9 MB. Free memory was 332.9 MB in the beginning and 318.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:39:58,659 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 86.0 MB. Free memory is still 54.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 609.62 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 55.8 MB in the beginning and 83.9 MB in the end (delta: -28.1 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 146.59 ms. Allocated memory is still 111.1 MB. Free memory was 83.9 MB in the beginning and 73.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 115.57 ms. Allocated memory is still 111.1 MB. Free memory was 73.4 MB in the beginning and 66.4 MB in the end (delta: 7.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2943.60 ms. Allocated memory was 111.1 MB in the beginning and 186.6 MB in the end (delta: 75.5 MB). Free memory was 66.4 MB in the beginning and 103.6 MB in the end (delta: -37.3 MB). Peak memory consumption was 61.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10313.12 ms. Allocated memory was 186.6 MB in the beginning and 385.9 MB in the end (delta: 199.2 MB). Free memory was 103.6 MB in the beginning and 332.9 MB in the end (delta: -229.2 MB). Peak memory consumption was 185.0 MB. Max. memory is 16.1 GB. * Witness Printer took 128.32 ms. Allocated memory is still 385.9 MB. Free memory was 332.9 MB in the beginning and 318.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1627]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int FloppyThread ; [L43] int KernelMode ; [L44] int Suspended ; [L45] int Executive ; [L46] int DiskController ; [L47] int FloppyDiskPeripheral ; [L48] int FlConfigCallBack ; [L49] int MaximumInterfaceType ; [L50] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L51] int myStatus ; [L52] int s ; [L53] int UNLOADED ; [L54] int NP ; [L55] int DC ; [L56] int SKIP1 ; [L57] int SKIP2 ; [L58] int MPR1 ; [L59] int MPR3 ; [L60] int IPC ; [L61] int pended ; [L62] int compRegistered ; [L63] int lowerDriverReturn ; [L64] int setEventCalled ; [L65] int customIrp ; [L88] int PagingReferenceCount = 0; [L89] int PagingMutex = 0; [L668] int status ; [L669] int irp = __VERIFIER_nondet_int() ; [L670] int pirp ; [L671] int pirp__IoStatus__Status ; [L672] int irp_choice = __VERIFIER_nondet_int() ; [L673] int devobj = __VERIFIER_nondet_int() ; [L674] int __cil_tmp8 ; [L676] FloppyThread = 0 [L677] KernelMode = 0 [L678] Suspended = 0 [L679] Executive = 0 [L680] DiskController = 0 [L681] FloppyDiskPeripheral = 0 [L682] FlConfigCallBack = 0 [L683] MaximumInterfaceType = 0 [L684] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L685] myStatus = 0 [L686] s = 0 [L687] UNLOADED = 0 [L688] NP = 0 [L689] DC = 0 [L690] SKIP1 = 0 [L691] SKIP2 = 0 [L692] MPR1 = 0 [L693] MPR3 = 0 [L694] IPC = 0 [L695] pended = 0 [L696] compRegistered = 0 [L697] lowerDriverReturn = 0 [L698] setEventCalled = 0 [L699] customIrp = 0 [L703] status = 0 [L704] pirp = irp [L71] UNLOADED = 0 [L72] NP = 1 [L73] DC = 2 [L74] SKIP1 = 3 [L75] SKIP2 = 4 [L76] MPR1 = 5 [L77] MPR3 = 6 [L78] IPC = 7 [L79] s = UNLOADED [L80] pended = 0 [L81] compRegistered = 0 [L82] lowerDriverReturn = 0 [L83] setEventCalled = 0 [L84] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L707] COND TRUE status >= 0 [L708] s = NP [L709] customIrp = 0 [L710] setEventCalled = customIrp [L711] lowerDriverReturn = setEventCalled [L712] compRegistered = lowerDriverReturn [L713] pended = compRegistered [L714] pirp__IoStatus__Status = 0 [L715] myStatus = 0 [L716] COND TRUE irp_choice == 0 [L717] pirp__IoStatus__Status = -1073741637 [L718] myStatus = -1073741637 [L658] s = NP [L659] pended = 0 [L660] compRegistered = 0 [L661] lowerDriverReturn = 0 [L662] setEventCalled = 0 [L663] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L724] COND FALSE !(status < 0) [L728] int tmp_ndt_1; [L729] tmp_ndt_1 = __VERIFIER_nondet_int() [L730] COND FALSE !(tmp_ndt_1 == 0) [L733] int tmp_ndt_2; [L734] tmp_ndt_2 = __VERIFIER_nondet_int() [L735] COND FALSE !(tmp_ndt_2 == 1) [L738] int tmp_ndt_3; [L739] tmp_ndt_3 = __VERIFIER_nondet_int() [L740] COND FALSE !(tmp_ndt_3 == 2) [L743] int tmp_ndt_4; [L744] tmp_ndt_4 = __VERIFIER_nondet_int() [L745] COND TRUE tmp_ndt_4 == 3 [L161] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L162] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L163] int Irp__IoStatus__Information ; [L164] int Irp__IoStatus__Status ; [L165] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L166] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L168] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L169] int disketteExtension__HoldNewRequests ; [L170] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L171] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L173] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L175] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L176] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L177] int irpSp ; [L178] int disketteExtension ; [L179] int ntStatus ; [L180] int doneEvent = __VERIFIER_nondet_int() ; [L181] int irpSp___0 ; [L182] int nextIrpSp ; [L183] int nextIrpSp__Control ; [L184] int irpSp___1 ; [L185] int irpSp__Context ; [L186] int irpSp__Control ; [L187] long __cil_tmp29 ; [L188] long __cil_tmp30 ; [L191] ntStatus = 0 [L192] PagingReferenceCount ++ [L193] COND TRUE PagingReferenceCount == 1 [L196] disketteExtension = DeviceObject__DeviceExtension [L197] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L207] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L236] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND FALSE !(! disketteExtension__IsStarted) [L255] disketteExtension__HoldNewRequests = 1 [L98] int status ; [L99] int threadHandle = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L103] int Irp__IoStatus__Status ; [L104] int Irp__IoStatus__Information ; [L105] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L106] int ObjAttributes = __VERIFIER_nondet_int() ; [L107] int __cil_tmp12 ; [L108] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L111] COND FALSE !(DisketteExtension__PoweringDown == 1) [L117] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L118] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L150] COND TRUE pended == 0 [L151] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L157] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L256] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L259] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L260] COND TRUE __cil_tmp29 == 259L [L1066] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1075] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1079] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1086] int tmp_ndt_12; [L1087] tmp_ndt_12 = __VERIFIER_nondet_int() [L1088] COND TRUE tmp_ndt_12 == 0 [L1094] return (0); [L265] COND FALSE !(disketteExtension__FloppyThread != 0) [L268] disketteExtension__FloppyThread = 0 [L269] Irp__IoStatus__Status = 0 [L270] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] COND TRUE s == NP [L272] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] Irp__CurrentLocation ++ [L280] Irp__Tail__Overlay__CurrentStackLocation ++ [L968] int returnVal2 ; [L969] int compRetStatus1 ; [L970] int lcontext = __VERIFIER_nondet_int() ; [L971] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L974] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] int tmp_ndt_10; [L988] tmp_ndt_10 = __VERIFIER_nondet_int() [L989] COND FALSE !(tmp_ndt_10 == 0) [L992] int tmp_ndt_11; [L993] tmp_ndt_11 = __VERIFIER_nondet_int() [L994] COND TRUE tmp_ndt_11 == 1 [L1003] returnVal2 = -1073741823 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1013] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1017] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1026] COND TRUE s == SKIP1 [L1027] s = SKIP2 [L1028] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1036] return (returnVal2); [L281] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L427] PagingReferenceCount -- [L428] COND TRUE PagingReferenceCount == 0 [L431] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] status = FloppyPnp(devobj, pirp) [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L788] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L789] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L796] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L797] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L798] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L812] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L813] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1627] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 354 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12805 SDtfs, 7420 SDslu, 15630 SDs, 0 SdLazy, 3706 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=3, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 758 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1211 NumberOfCodeBlocks, 1211 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 2843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 04:39:58,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d099f89-bfb5-4873-b440-21e1141381a3/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...