./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9 --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 79b55bbc1c83a113dd61cfbd1c59324170026eea9fc3fed8c2e488e492b32e33 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:29:23,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:29:23,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:29:23,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:29:23,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:29:23,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:29:23,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:29:23,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:29:23,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:29:23,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:29:23,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:29:23,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:29:23,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:29:23,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:29:23,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:29:23,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:29:23,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:29:23,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:29:23,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:29:23,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:29:23,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:29:23,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:29:23,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:29:23,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:29:23,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:29:23,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:29:23,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:29:23,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:29:23,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:29:23,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:29:23,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:29:23,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:29:23,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:29:23,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:29:23,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:29:23,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:29:23,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:29:23,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:29:23,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:29:23,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:29:23,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:29:23,259 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 21:29:23,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:29:23,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:29:23,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:29:23,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:29:23,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:29:23,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:29:23,280 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:29:23,281 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:29:23,281 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:29:23,281 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:29:23,281 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:29:23,281 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:29:23,282 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:29:23,282 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:29:23,282 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:29:23,282 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:29:23,283 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:29:23,283 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:29:23,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:29:23,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:29:23,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:29:23,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:29:23,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:29:23,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:29:23,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:29:23,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:29:23,285 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:29:23,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:29:23,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:29:23,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:29:23,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:29:23,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:29:23,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:29:23,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:29:23,287 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:29:23,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:29:23,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:29:23,287 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:29:23,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:29:23,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:29:23,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:29:23,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/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_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9 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 -> 79b55bbc1c83a113dd61cfbd1c59324170026eea9fc3fed8c2e488e492b32e33 [2022-11-20 21:29:23,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:29:23,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:29:23,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:29:23,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:29:23,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:29:23,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2022-11-20 21:29:26,668 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:29:27,013 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:29:27,014 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2022-11-20 21:29:27,051 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/data/f3c353f65/489e7ae627df4be5981307cd511b3001/FLAG8e5ae7cbc [2022-11-20 21:29:27,070 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/data/f3c353f65/489e7ae627df4be5981307cd511b3001 [2022-11-20 21:29:27,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:29:27,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:29:27,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:29:27,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:29:27,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:29:27,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:27" (1/1) ... [2022-11-20 21:29:27,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efb15ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:27, skipping insertion in model container [2022-11-20 21:29:27,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:27" (1/1) ... [2022-11-20 21:29:27,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:29:27,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:29:27,920 WARN L237 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_46c926a0-407b-4dbf-a0aa-63479a36ce23/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-11-20 21:29:27,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:29:27,981 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:29:28,064 WARN L237 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_46c926a0-407b-4dbf-a0aa-63479a36ce23/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-11-20 21:29:28,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:29:28,209 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:29:28,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28 WrapperNode [2022-11-20 21:29:28,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:29:28,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:29:28,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:29:28,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:29:28,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,288 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-11-20 21:29:28,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:29:28,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:29:28,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:29:28,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:29:28,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,339 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:29:28,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:29:28,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:29:28,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:29:28,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (1/1) ... [2022-11-20 21:29:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:29:28,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:29:28,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:29:28,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:29:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 21:29:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 21:29:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 21:29:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:29:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 21:29:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:29:28,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:29:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-20 21:29:28,444 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-20 21:29:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 21:29:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 21:29:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:29:28,447 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 21:29:28,868 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:29:28,870 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:29:29,203 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:29:29,211 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:29:29,211 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 21:29:29,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:29 BoogieIcfgContainer [2022-11-20 21:29:29,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:29:29,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:29:29,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:29:29,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:29:29,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:29:27" (1/3) ... [2022-11-20 21:29:29,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90dee52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:29, skipping insertion in model container [2022-11-20 21:29:29,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:28" (2/3) ... [2022-11-20 21:29:29,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90dee52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:29, skipping insertion in model container [2022-11-20 21:29:29,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:29" (3/3) ... [2022-11-20 21:29:29,238 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-11-20 21:29:29,262 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 21:29:29,273 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:29:29,273 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-20 21:29:29,273 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 21:29:29,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 21:29:29,457 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 21:29:29,473 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 194 transitions, 404 flow [2022-11-20 21:29:29,476 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 194 transitions, 404 flow [2022-11-20 21:29:29,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 194 transitions, 404 flow [2022-11-20 21:29:29,581 INFO L130 PetriNetUnfolder]: 10/239 cut-off events. [2022-11-20 21:29:29,582 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 21:29:29,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 239 events. 10/239 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 390 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2022-11-20 21:29:29,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 3224 [2022-11-20 21:30:31,166 INFO L134 LiptonReduction]: Checked pairs total: 7205 [2022-11-20 21:30:31,167 INFO L136 LiptonReduction]: Total number of compositions: 219 [2022-11-20 21:30:31,175 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 37 transitions, 90 flow [2022-11-20 21:30:31,240 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 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) [2022-11-20 21:30:31,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:30:31,266 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20e2c498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:30:31,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 21:30:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 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) [2022-11-20 21:30:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 21:30:31,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:31,282 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 21:30:31,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 687, now seen corresponding path program 1 times [2022-11-20 21:30:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:31,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950497891] [2022-11-20 21:30:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:31,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:31,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950497891] [2022-11-20 21:30:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950497891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:31,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:31,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 21:30:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900518687] [2022-11-20 21:30:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:31,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 21:30:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 21:30:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 21:30:31,599 INFO L87 Difference]: Start difference. First operand has 405 states, 395 states have (on average 2.6126582278481014) internal successors, (1032), 404 states have internal predecessors, (1032), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 21:30:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:31,724 INFO L93 Difference]: Finished difference Result 403 states and 993 transitions. [2022-11-20 21:30:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 21:30:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-20 21:30:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:31,742 INFO L225 Difference]: With dead ends: 403 [2022-11-20 21:30:31,748 INFO L226 Difference]: Without dead ends: 366 [2022-11-20 21:30:31,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 21:30:31,753 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:31,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:30:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-20 21:30:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-11-20 21:30:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 2.488888888888889) internal successors, (896), 365 states have internal predecessors, (896), 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) [2022-11-20 21:30:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 896 transitions. [2022-11-20 21:30:31,847 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 896 transitions. Word has length 1 [2022-11-20 21:30:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:31,848 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 896 transitions. [2022-11-20 21:30:31,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 21:30:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 896 transitions. [2022-11-20 21:30:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 21:30:31,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:31,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 21:30:31,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:30:31,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash 21166370, now seen corresponding path program 1 times [2022-11-20 21:30:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:31,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487266592] [2022-11-20 21:30:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:32,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487266592] [2022-11-20 21:30:32,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487266592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:32,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:32,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:30:32,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865366341] [2022-11-20 21:30:32,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:32,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:30:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:30:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:30:32,438 INFO L87 Difference]: Start difference. First operand 366 states and 896 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2022-11-20 21:30:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:32,605 INFO L93 Difference]: Finished difference Result 521 states and 1271 transitions. [2022-11-20 21:30:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:30:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-11-20 21:30:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:32,610 INFO L225 Difference]: With dead ends: 521 [2022-11-20 21:30:32,610 INFO L226 Difference]: Without dead ends: 521 [2022-11-20 21:30:32,611 INFO L412 NwaCegarLoop]: 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 [2022-11-20 21:30:32,612 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:32,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:30:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-11-20 21:30:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 425. [2022-11-20 21:30:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 2.5023809523809524) internal successors, (1051), 424 states have internal predecessors, (1051), 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) [2022-11-20 21:30:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1051 transitions. [2022-11-20 21:30:32,652 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1051 transitions. Word has length 4 [2022-11-20 21:30:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:32,652 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 1051 transitions. [2022-11-20 21:30:32,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2022-11-20 21:30:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1051 transitions. [2022-11-20 21:30:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 21:30:32,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:32,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 21:30:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:30:32,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1133952232, now seen corresponding path program 1 times [2022-11-20 21:30:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060767499] [2022-11-20 21:30:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:32,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:32,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060767499] [2022-11-20 21:30:32,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060767499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:32,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:32,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:30:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612050362] [2022-11-20 21:30:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:32,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:30:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:32,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:30:32,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:30:32,941 INFO L87 Difference]: Start difference. First operand 425 states and 1051 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-11-20 21:30:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:33,226 INFO L93 Difference]: Finished difference Result 580 states and 1394 transitions. [2022-11-20 21:30:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:30:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2022-11-20 21:30:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:33,230 INFO L225 Difference]: With dead ends: 580 [2022-11-20 21:30:33,230 INFO L226 Difference]: Without dead ends: 495 [2022-11-20 21:30:33,231 INFO L412 NwaCegarLoop]: 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 [2022-11-20 21:30:33,232 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:33,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:30:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-11-20 21:30:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 463. [2022-11-20 21:30:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 459 states have (on average 2.52723311546841) internal successors, (1160), 462 states have internal predecessors, (1160), 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) [2022-11-20 21:30:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1160 transitions. [2022-11-20 21:30:33,255 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1160 transitions. Word has length 6 [2022-11-20 21:30:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:33,255 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1160 transitions. [2022-11-20 21:30:33,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2022-11-20 21:30:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1160 transitions. [2022-11-20 21:30:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 21:30:33,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:33,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:33,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 21:30:33,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1636681417, now seen corresponding path program 1 times [2022-11-20 21:30:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:33,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329031956] [2022-11-20 21:30:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:33,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329031956] [2022-11-20 21:30:33,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329031956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:33,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:30:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775798095] [2022-11-20 21:30:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:33,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:30:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:30:33,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:30:33,375 INFO L87 Difference]: Start difference. First operand 463 states and 1160 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-11-20 21:30:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:33,459 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2022-11-20 21:30:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:30:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 [2022-11-20 21:30:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:33,460 INFO L225 Difference]: With dead ends: 143 [2022-11-20 21:30:33,461 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 21:30:33,461 INFO L412 NwaCegarLoop]: 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 [2022-11-20 21:30:33,462 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:33,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:30:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 21:30:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-20 21:30:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 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) [2022-11-20 21:30:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2022-11-20 21:30:33,469 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 10 [2022-11-20 21:30:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:33,470 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2022-11-20 21:30:33,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-11-20 21:30:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2022-11-20 21:30:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:33,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:33,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:33,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 21:30:33,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:33,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2133222575, now seen corresponding path program 1 times [2022-11-20 21:30:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:33,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917398494] [2022-11-20 21:30:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:36,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:36,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917398494] [2022-11-20 21:30:36,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917398494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:36,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:36,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314899642] [2022-11-20 21:30:36,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:36,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:36,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:36,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:36,590 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:37,767 INFO L93 Difference]: Finished difference Result 222 states and 473 transitions. [2022-11-20 21:30:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 21:30:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:30:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:37,770 INFO L225 Difference]: With dead ends: 222 [2022-11-20 21:30:37,770 INFO L226 Difference]: Without dead ends: 222 [2022-11-20 21:30:37,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:30:37,771 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:37,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 21:30:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-20 21:30:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2022-11-20 21:30:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.165680473372781) internal successors, (366), 170 states have internal predecessors, (366), 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) [2022-11-20 21:30:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 366 transitions. [2022-11-20 21:30:37,778 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 366 transitions. Word has length 21 [2022-11-20 21:30:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:37,779 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 366 transitions. [2022-11-20 21:30:37,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 366 transitions. [2022-11-20 21:30:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:37,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:37,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:37,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 21:30:37,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2133222598, now seen corresponding path program 1 times [2022-11-20 21:30:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:37,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969957023] [2022-11-20 21:30:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:38,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:38,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969957023] [2022-11-20 21:30:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969957023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:38,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:38,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:30:38,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870830259] [2022-11-20 21:30:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:30:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:30:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:30:38,889 INFO L87 Difference]: Start difference. First operand 171 states and 366 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:39,319 INFO L93 Difference]: Finished difference Result 246 states and 496 transitions. [2022-11-20 21:30:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:30:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:30:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:39,321 INFO L225 Difference]: With dead ends: 246 [2022-11-20 21:30:39,321 INFO L226 Difference]: Without dead ends: 230 [2022-11-20 21:30:39,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:30:39,322 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:39,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:30:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-20 21:30:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 192. [2022-11-20 21:30:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.1526315789473682) internal successors, (409), 191 states have internal predecessors, (409), 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) [2022-11-20 21:30:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 409 transitions. [2022-11-20 21:30:39,332 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 409 transitions. Word has length 21 [2022-11-20 21:30:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:39,333 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 409 transitions. [2022-11-20 21:30:39,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 409 transitions. [2022-11-20 21:30:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:39,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:39,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:39,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 21:30:39,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -872367349, now seen corresponding path program 2 times [2022-11-20 21:30:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:39,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574521518] [2022-11-20 21:30:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:41,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:41,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574521518] [2022-11-20 21:30:41,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574521518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:41,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:41,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362748029] [2022-11-20 21:30:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:41,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:41,443 INFO L87 Difference]: Start difference. First operand 192 states and 409 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:42,509 INFO L93 Difference]: Finished difference Result 292 states and 592 transitions. [2022-11-20 21:30:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 21:30:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:30:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:42,511 INFO L225 Difference]: With dead ends: 292 [2022-11-20 21:30:42,512 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 21:30:42,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:30:42,513 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 62 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:42,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 21:30:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 21:30:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2022-11-20 21:30:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.1344086021505375) internal successors, (397), 187 states have internal predecessors, (397), 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) [2022-11-20 21:30:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 397 transitions. [2022-11-20 21:30:42,520 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 397 transitions. Word has length 21 [2022-11-20 21:30:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:42,521 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 397 transitions. [2022-11-20 21:30:42,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 397 transitions. [2022-11-20 21:30:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:42,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:42,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:42,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 21:30:42,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1040952973, now seen corresponding path program 3 times [2022-11-20 21:30:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452302363] [2022-11-20 21:30:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:45,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:45,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452302363] [2022-11-20 21:30:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452302363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:45,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:45,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600762386] [2022-11-20 21:30:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:45,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:45,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:45,052 INFO L87 Difference]: Start difference. First operand 188 states and 397 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:46,146 INFO L93 Difference]: Finished difference Result 284 states and 575 transitions. [2022-11-20 21:30:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:30:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:30:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:46,148 INFO L225 Difference]: With dead ends: 284 [2022-11-20 21:30:46,148 INFO L226 Difference]: Without dead ends: 259 [2022-11-20 21:30:46,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:30:46,149 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:46,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 21:30:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-20 21:30:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 210. [2022-11-20 21:30:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.0625) internal successors, (429), 209 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) [2022-11-20 21:30:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 429 transitions. [2022-11-20 21:30:46,157 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 429 transitions. Word has length 21 [2022-11-20 21:30:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:46,157 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 429 transitions. [2022-11-20 21:30:46,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 429 transitions. [2022-11-20 21:30:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:46,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:46,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:46,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 21:30:46,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1529830598, now seen corresponding path program 2 times [2022-11-20 21:30:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:46,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525948672] [2022-11-20 21:30:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:46,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:46,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525948672] [2022-11-20 21:30:46,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525948672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:46,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:46,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:30:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744805071] [2022-11-20 21:30:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:46,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:30:46,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:30:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:30:46,966 INFO L87 Difference]: Start difference. First operand 210 states and 429 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:47,283 INFO L93 Difference]: Finished difference Result 295 states and 568 transitions. [2022-11-20 21:30:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:30:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:30:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:47,285 INFO L225 Difference]: With dead ends: 295 [2022-11-20 21:30:47,285 INFO L226 Difference]: Without dead ends: 265 [2022-11-20 21:30:47,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:30:47,286 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:47,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:30:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-20 21:30:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 189. [2022-11-20 21:30:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 2.106951871657754) internal successors, (394), 188 states have internal predecessors, (394), 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) [2022-11-20 21:30:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 394 transitions. [2022-11-20 21:30:47,294 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 394 transitions. Word has length 21 [2022-11-20 21:30:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:47,294 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 394 transitions. [2022-11-20 21:30:47,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 394 transitions. [2022-11-20 21:30:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:47,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:47,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:47,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 21:30:47,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1301123853, now seen corresponding path program 4 times [2022-11-20 21:30:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:47,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070978159] [2022-11-20 21:30:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:49,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070978159] [2022-11-20 21:30:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070978159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:49,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104393972] [2022-11-20 21:30:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:49,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:49,186 INFO L87 Difference]: Start difference. First operand 189 states and 394 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:50,368 INFO L93 Difference]: Finished difference Result 298 states and 592 transitions. [2022-11-20 21:30:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:30:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:30:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:50,371 INFO L225 Difference]: With dead ends: 298 [2022-11-20 21:30:50,371 INFO L226 Difference]: Without dead ends: 298 [2022-11-20 21:30:50,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:30:50,372 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:50,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 21:30:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-20 21:30:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 220. [2022-11-20 21:30:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 218 states have (on average 2.041284403669725) internal successors, (445), 219 states have internal predecessors, (445), 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) [2022-11-20 21:30:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 445 transitions. [2022-11-20 21:30:50,386 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 445 transitions. Word has length 21 [2022-11-20 21:30:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:50,386 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 445 transitions. [2022-11-20 21:30:50,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 445 transitions. [2022-11-20 21:30:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:50,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:50,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:50,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 21:30:50,388 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1301123876, now seen corresponding path program 3 times [2022-11-20 21:30:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:50,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402338233] [2022-11-20 21:30:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:51,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402338233] [2022-11-20 21:30:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402338233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:51,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:30:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508317653] [2022-11-20 21:30:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:30:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:30:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:30:51,165 INFO L87 Difference]: Start difference. First operand 220 states and 445 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:51,525 INFO L93 Difference]: Finished difference Result 278 states and 539 transitions. [2022-11-20 21:30:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:30:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:30:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:51,527 INFO L225 Difference]: With dead ends: 278 [2022-11-20 21:30:51,527 INFO L226 Difference]: Without dead ends: 239 [2022-11-20 21:30:51,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:30:51,528 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:51,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 12 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:30:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-20 21:30:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 172. [2022-11-20 21:30:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 2.123529411764706) internal successors, (361), 171 states have internal predecessors, (361), 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) [2022-11-20 21:30:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 361 transitions. [2022-11-20 21:30:51,534 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 361 transitions. Word has length 21 [2022-11-20 21:30:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:51,534 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 361 transitions. [2022-11-20 21:30:51,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:30:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 361 transitions. [2022-11-20 21:30:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:51,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:51,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:51,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 21:30:51,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 629805873, now seen corresponding path program 5 times [2022-11-20 21:30:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:51,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565735851] [2022-11-20 21:30:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:51,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:51,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565735851] [2022-11-20 21:30:51,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565735851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:51,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:51,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:30:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274116052] [2022-11-20 21:30:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:51,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:30:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:51,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:30:51,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:30:51,905 INFO L87 Difference]: Start difference. First operand 172 states and 361 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) [2022-11-20 21:30:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:51,994 INFO L93 Difference]: Finished difference Result 184 states and 371 transitions. [2022-11-20 21:30:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:30:51,994 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 [2022-11-20 21:30:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:51,995 INFO L225 Difference]: With dead ends: 184 [2022-11-20 21:30:51,996 INFO L226 Difference]: Without dead ends: 184 [2022-11-20 21:30:51,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:30:51,996 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:51,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:30:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-20 21:30:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2022-11-20 21:30:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 2.0647058823529414) internal successors, (351), 171 states have internal predecessors, (351), 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) [2022-11-20 21:30:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 351 transitions. [2022-11-20 21:30:52,003 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 351 transitions. Word has length 21 [2022-11-20 21:30:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:52,003 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 351 transitions. [2022-11-20 21:30:52,003 INFO L496 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) [2022-11-20 21:30:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 351 transitions. [2022-11-20 21:30:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:52,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:52,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:52,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 21:30:52,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1832422323, now seen corresponding path program 6 times [2022-11-20 21:30:52,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:52,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127059626] [2022-11-20 21:30:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:53,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127059626] [2022-11-20 21:30:53,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127059626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:53,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:53,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 21:30:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819523175] [2022-11-20 21:30:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:53,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 21:30:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 21:30:53,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-20 21:30:53,668 INFO L87 Difference]: Start difference. First operand 172 states and 351 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2022-11-20 21:30:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:54,337 INFO L93 Difference]: Finished difference Result 202 states and 395 transitions. [2022-11-20 21:30:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:30:54,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 [2022-11-20 21:30:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:54,339 INFO L225 Difference]: With dead ends: 202 [2022-11-20 21:30:54,339 INFO L226 Difference]: Without dead ends: 171 [2022-11-20 21:30:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-20 21:30:54,340 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:54,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 21:30:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-20 21:30:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-11-20 21:30:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.06508875739645) internal successors, (349), 170 states have internal predecessors, (349), 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) [2022-11-20 21:30:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 349 transitions. [2022-11-20 21:30:54,346 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 349 transitions. Word has length 21 [2022-11-20 21:30:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:54,346 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 349 transitions. [2022-11-20 21:30:54,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) [2022-11-20 21:30:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 349 transitions. [2022-11-20 21:30:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:54,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:54,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:54,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 21:30:54,348 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1587585777, now seen corresponding path program 7 times [2022-11-20 21:30:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:54,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524259291] [2022-11-20 21:30:54,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:56,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:56,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524259291] [2022-11-20 21:30:56,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524259291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:56,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:56,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:56,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117935883] [2022-11-20 21:30:56,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:56,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:56,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:56,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:56,199 INFO L87 Difference]: Start difference. First operand 171 states and 349 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:30:57,412 INFO L93 Difference]: Finished difference Result 251 states and 489 transitions. [2022-11-20 21:30:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 21:30:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:30:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:30:57,414 INFO L225 Difference]: With dead ends: 251 [2022-11-20 21:30:57,415 INFO L226 Difference]: Without dead ends: 221 [2022-11-20 21:30:57,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-11-20 21:30:57,416 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 21:30:57,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 21:30:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-20 21:30:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2022-11-20 21:30:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.066265060240964) internal successors, (343), 167 states have internal predecessors, (343), 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) [2022-11-20 21:30:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 343 transitions. [2022-11-20 21:30:57,423 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 343 transitions. Word has length 21 [2022-11-20 21:30:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:30:57,423 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 343 transitions. [2022-11-20 21:30:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:30:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 343 transitions. [2022-11-20 21:30:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:30:57,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:30:57,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:30:57,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 21:30:57,425 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:30:57,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:30:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash -867399007, now seen corresponding path program 8 times [2022-11-20 21:30:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:30:57,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367545633] [2022-11-20 21:30:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:30:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:30:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:30:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:30:59,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:30:59,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367545633] [2022-11-20 21:30:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367545633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:30:59,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:30:59,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:30:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952941370] [2022-11-20 21:30:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:30:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:30:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:30:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:30:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:30:59,274 INFO L87 Difference]: Start difference. First operand 168 states and 343 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:00,251 INFO L93 Difference]: Finished difference Result 241 states and 462 transitions. [2022-11-20 21:31:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:31:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:00,253 INFO L225 Difference]: With dead ends: 241 [2022-11-20 21:31:00,253 INFO L226 Difference]: Without dead ends: 204 [2022-11-20 21:31:00,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:00,257 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:00,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 21:31:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-20 21:31:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2022-11-20 21:31:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 2.069620253164557) internal successors, (327), 159 states have internal predecessors, (327), 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) [2022-11-20 21:31:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 327 transitions. [2022-11-20 21:31:00,263 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 327 transitions. Word has length 21 [2022-11-20 21:31:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:00,263 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 327 transitions. [2022-11-20 21:31:00,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 327 transitions. [2022-11-20 21:31:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:00,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:00,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:00,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 21:31:00,265 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 340908783, now seen corresponding path program 9 times [2022-11-20 21:31:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:00,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26786068] [2022-11-20 21:31:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:00,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:00,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26786068] [2022-11-20 21:31:00,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26786068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:00,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:00,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:31:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813557562] [2022-11-20 21:31:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:00,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:31:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:31:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:31:00,577 INFO L87 Difference]: Start difference. First operand 160 states and 327 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) [2022-11-20 21:31:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:00,655 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2022-11-20 21:31:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:31:00,655 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 [2022-11-20 21:31:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:00,656 INFO L225 Difference]: With dead ends: 72 [2022-11-20 21:31:00,656 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 21:31:00,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:31:00,657 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:00,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:31:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 21:31:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 21:31:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 71 states have internal predecessors, (107), 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) [2022-11-20 21:31:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2022-11-20 21:31:00,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 21 [2022-11-20 21:31:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:00,659 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2022-11-20 21:31:00,659 INFO L496 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) [2022-11-20 21:31:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2022-11-20 21:31:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:00,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:00,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 21:31:00,660 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1439470513, now seen corresponding path program 10 times [2022-11-20 21:31:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:00,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487499224] [2022-11-20 21:31:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:02,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:02,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487499224] [2022-11-20 21:31:02,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487499224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:02,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:02,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214108117] [2022-11-20 21:31:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:02,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:02,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:02,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:02,325 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:02,959 INFO L93 Difference]: Finished difference Result 84 states and 119 transitions. [2022-11-20 21:31:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:02,960 INFO L225 Difference]: With dead ends: 84 [2022-11-20 21:31:02,960 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 21:31:02,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:02,961 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:02,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:31:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 21:31:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 21:31:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.451219512195122) internal successors, (119), 83 states have internal predecessors, (119), 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) [2022-11-20 21:31:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-11-20 21:31:02,965 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 21 [2022-11-20 21:31:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:02,965 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-11-20 21:31:02,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-11-20 21:31:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:02,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:02,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:02,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 21:31:02,967 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1439470490, now seen corresponding path program 4 times [2022-11-20 21:31:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431501602] [2022-11-20 21:31:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:03,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:03,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431501602] [2022-11-20 21:31:03,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431501602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:03,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:03,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:31:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263040741] [2022-11-20 21:31:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:03,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:31:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:31:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:31:03,698 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:03,966 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2022-11-20 21:31:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:31:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:31:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:03,967 INFO L225 Difference]: With dead ends: 93 [2022-11-20 21:31:03,967 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 21:31:03,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:31:03,968 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:03,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 11 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:31:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 21:31:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-11-20 21:31:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 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) [2022-11-20 21:31:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2022-11-20 21:31:03,971 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 21 [2022-11-20 21:31:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:03,971 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-11-20 21:31:03,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2022-11-20 21:31:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:03,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:03,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:03,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 21:31:03,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash 245774391, now seen corresponding path program 11 times [2022-11-20 21:31:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:03,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415901070] [2022-11-20 21:31:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:05,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:05,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415901070] [2022-11-20 21:31:05,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415901070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:05,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:05,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678932014] [2022-11-20 21:31:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:05,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:05,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:05,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:05,543 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:06,327 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2022-11-20 21:31:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:06,328 INFO L225 Difference]: With dead ends: 87 [2022-11-20 21:31:06,328 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 21:31:06,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:06,329 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:06,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 21:31:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 21:31:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 21:31:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 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) [2022-11-20 21:31:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2022-11-20 21:31:06,332 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 21 [2022-11-20 21:31:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:06,332 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2022-11-20 21:31:06,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2022-11-20 21:31:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:06,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:06,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:06,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 21:31:06,334 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:06,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1108697773, now seen corresponding path program 12 times [2022-11-20 21:31:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:06,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64625568] [2022-11-20 21:31:06,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:07,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64625568] [2022-11-20 21:31:07,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64625568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:07,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:07,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913811230] [2022-11-20 21:31:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:07,837 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:08,628 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2022-11-20 21:31:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:08,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:08,629 INFO L225 Difference]: With dead ends: 83 [2022-11-20 21:31:08,629 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 21:31:08,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:08,630 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:08,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 21:31:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 21:31:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-20 21:31:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 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) [2022-11-20 21:31:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2022-11-20 21:31:08,633 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 21 [2022-11-20 21:31:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:08,634 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2022-11-20 21:31:08,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2022-11-20 21:31:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:08,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:08,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:08,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 21:31:08,635 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1108697750, now seen corresponding path program 5 times [2022-11-20 21:31:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394042283] [2022-11-20 21:31:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:09,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394042283] [2022-11-20 21:31:09,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394042283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:09,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:09,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:31:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179838147] [2022-11-20 21:31:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:31:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:31:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:31:09,191 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:09,412 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-11-20 21:31:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:31:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:31:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:09,413 INFO L225 Difference]: With dead ends: 92 [2022-11-20 21:31:09,414 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 21:31:09,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:31:09,414 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:09,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 10 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:31:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 21:31:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-11-20 21:31:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 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) [2022-11-20 21:31:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-11-20 21:31:09,418 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 21 [2022-11-20 21:31:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:09,419 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-11-20 21:31:09,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-11-20 21:31:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:09,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:09,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:09,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 21:31:09,422 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1360533827, now seen corresponding path program 13 times [2022-11-20 21:31:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:09,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411325828] [2022-11-20 21:31:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:10,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411325828] [2022-11-20 21:31:10,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411325828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:10,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:10,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577701776] [2022-11-20 21:31:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:10,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:10,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:10,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:10,817 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:11,468 INFO L93 Difference]: Finished difference Result 91 states and 121 transitions. [2022-11-20 21:31:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:11,469 INFO L225 Difference]: With dead ends: 91 [2022-11-20 21:31:11,469 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 21:31:11,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:11,470 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:11,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 21:31:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 21:31:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-11-20 21:31:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 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) [2022-11-20 21:31:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-11-20 21:31:11,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 21 [2022-11-20 21:31:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:11,473 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-11-20 21:31:11,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-11-20 21:31:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:11,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:11,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:11,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 21:31:11,475 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1360533804, now seen corresponding path program 6 times [2022-11-20 21:31:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767246896] [2022-11-20 21:31:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:12,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:12,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767246896] [2022-11-20 21:31:12,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767246896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:12,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:12,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 21:31:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344326169] [2022-11-20 21:31:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:12,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 21:31:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 21:31:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 21:31:12,033 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:12,257 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2022-11-20 21:31:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 21:31:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 [2022-11-20 21:31:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:12,258 INFO L225 Difference]: With dead ends: 84 [2022-11-20 21:31:12,258 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 21:31:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 21:31:12,259 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:12,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:31:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 21:31:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-11-20 21:31:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 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) [2022-11-20 21:31:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2022-11-20 21:31:12,262 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 21 [2022-11-20 21:31:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:12,262 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2022-11-20 21:31:12,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) [2022-11-20 21:31:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2022-11-20 21:31:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:12,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:12,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 21:31:12,263 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1671739391, now seen corresponding path program 14 times [2022-11-20 21:31:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232020000] [2022-11-20 21:31:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:13,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:13,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232020000] [2022-11-20 21:31:13,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232020000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:13,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:13,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:13,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35332531] [2022-11-20 21:31:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:13,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:13,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:13,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:13,606 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:14,250 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-11-20 21:31:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:14,251 INFO L225 Difference]: With dead ends: 69 [2022-11-20 21:31:14,252 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 21:31:14,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:14,252 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:14,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 21:31:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 21:31:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 21:31:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 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) [2022-11-20 21:31:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2022-11-20 21:31:14,255 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 21 [2022-11-20 21:31:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:14,255 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2022-11-20 21:31:14,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-11-20 21:31:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:14,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:14,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:14,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 21:31:14,256 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2131205425, now seen corresponding path program 15 times [2022-11-20 21:31:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:14,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116320375] [2022-11-20 21:31:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:15,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:15,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116320375] [2022-11-20 21:31:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116320375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:15,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:15,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605871868] [2022-11-20 21:31:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:15,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:15,564 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:16,191 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-11-20 21:31:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:16,192 INFO L225 Difference]: With dead ends: 64 [2022-11-20 21:31:16,192 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 21:31:16,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:16,193 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:16,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 21:31:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 21:31:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 21:31:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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) [2022-11-20 21:31:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-11-20 21:31:16,196 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 21 [2022-11-20 21:31:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:16,196 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-11-20 21:31:16,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-11-20 21:31:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:16,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:16,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 21:31:16,197 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1046779423, now seen corresponding path program 16 times [2022-11-20 21:31:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588857726] [2022-11-20 21:31:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:16,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:17,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:17,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588857726] [2022-11-20 21:31:17,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588857726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:17,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:17,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126838808] [2022-11-20 21:31:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:17,533 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:18,104 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-11-20 21:31:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:18,105 INFO L225 Difference]: With dead ends: 51 [2022-11-20 21:31:18,105 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 21:31:18,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:18,106 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:18,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:31:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 21:31:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-20 21:31:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 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) [2022-11-20 21:31:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-11-20 21:31:18,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 21 [2022-11-20 21:31:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:18,108 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-11-20 21:31:18,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-11-20 21:31:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:31:18,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:31:18,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:31:18,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 21:31:18,110 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-20 21:31:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:31:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 478115663, now seen corresponding path program 17 times [2022-11-20 21:31:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:31:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238076006] [2022-11-20 21:31:18,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:31:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:31:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:31:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:31:19,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:31:19,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238076006] [2022-11-20 21:31:19,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238076006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:31:19,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:31:19,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 21:31:19,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436883780] [2022-11-20 21:31:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:31:19,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:31:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:31:19,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:31:19,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:31:19,387 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:31:19,859 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-20 21:31:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 21:31:19,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 [2022-11-20 21:31:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:31:19,859 INFO L225 Difference]: With dead ends: 21 [2022-11-20 21:31:19,859 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 21:31:19,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 21:31:19,860 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:31:19,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 21:31:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 21:31:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 21:31:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-11-20 21:31:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 21:31:19,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-20 21:31:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:31:19,861 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 21:31:19,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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) [2022-11-20 21:31:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 21:31:19,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 21:31:19,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-11-20 21:31:19,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-11-20 21:31:19,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-11-20 21:31:19,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-11-20 21:31:19,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-11-20 21:31:19,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-11-20 21:31:19,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-11-20 21:31:19,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-11-20 21:31:19,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 21:31:19,868 INFO L444 BasicCegarLoop]: Path program histogram: [17, 6, 1, 1, 1, 1] [2022-11-20 21:31:19,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 21:31:19,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 21:31:19,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:19 BasicIcfg [2022-11-20 21:31:19,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 21:31:19,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 21:31:19,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 21:31:19,874 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 21:31:19,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:29" (3/4) ... [2022-11-20 21:31:19,877 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 21:31:19,882 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2022-11-20 21:31:19,886 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-20 21:31:19,887 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 21:31:19,887 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 21:31:19,887 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 21:31:19,923 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 21:31:19,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 21:31:19,924 INFO L158 Benchmark]: Toolchain (without parser) took 112847.18ms. Allocated memory was 153.1MB in the beginning and 524.3MB in the end (delta: 371.2MB). Free memory was 116.2MB in the beginning and 386.3MB in the end (delta: -270.1MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,924 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 21:31:19,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1129.82ms. Allocated memory is still 153.1MB. Free memory was 116.2MB in the beginning and 76.3MB in the end (delta: 39.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.80ms. Allocated memory is still 153.1MB. Free memory was 76.3MB in the beginning and 72.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,925 INFO L158 Benchmark]: Boogie Preprocessor took 56.40ms. Allocated memory is still 153.1MB. Free memory was 72.9MB in the beginning and 70.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,925 INFO L158 Benchmark]: RCFGBuilder took 859.50ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 70.2MB in the beginning and 143.4MB in the end (delta: -73.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,926 INFO L158 Benchmark]: TraceAbstraction took 110657.58ms. Allocated memory was 184.5MB in the beginning and 524.3MB in the end (delta: 339.7MB). Free memory was 143.4MB in the beginning and 390.5MB in the end (delta: -247.1MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,926 INFO L158 Benchmark]: Witness Printer took 49.40ms. Allocated memory is still 524.3MB. Free memory was 390.5MB in the beginning and 386.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 21:31:19,927 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.34ms. Allocated memory is still 123.7MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1129.82ms. Allocated memory is still 153.1MB. Free memory was 116.2MB in the beginning and 76.3MB in the end (delta: 39.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.80ms. Allocated memory is still 153.1MB. Free memory was 76.3MB in the beginning and 72.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.40ms. Allocated memory is still 153.1MB. Free memory was 72.9MB in the beginning and 70.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.50ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 70.2MB in the beginning and 143.4MB in the end (delta: -73.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 110657.58ms. Allocated memory was 184.5MB in the beginning and 524.3MB in the end (delta: 339.7MB). Free memory was 143.4MB in the beginning and 390.5MB in the end (delta: -247.1MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Witness Printer took 49.40ms. Allocated memory is still 524.3MB. Free memory was 390.5MB in the beginning and 386.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.7s, 192 PlacesBefore, 40 PlacesAfterwards, 194 TransitionsBefore, 37 TransitionsAfterwards, 3224 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 23 ConcurrentYvCompositions, 5 ChoiceCompositions, 219 TotalNumberOfCompositions, 7205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3383, independent: 3146, independent conditional: 0, independent unconditional: 3146, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2243, independent: 2181, independent conditional: 0, independent unconditional: 2181, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2243, independent: 2175, independent conditional: 0, independent unconditional: 2175, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40076, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 39703, unknown conditional: 0, unknown unconditional: 39703] ], Cache Queries: [ total: 3383, independent: 965, independent conditional: 0, independent unconditional: 965, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 2301, unknown conditional: 0, unknown unconditional: 2301] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12 - 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 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 202 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 110.4s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 61.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7527 IncrementalHoareTripleChecker+Invalid, 7827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 66 mSDtfsCounter, 7527 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=3, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 702 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 10586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 21:31:19,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c926a0-407b-4dbf-a0aa-63479a36ce23/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE