./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba --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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- 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-b5237d8 [2022-11-22 01:29:51,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:29:51,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:29:51,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:29:51,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:29:51,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:29:51,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:29:51,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:29:51,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:29:51,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:29:51,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:29:51,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:29:51,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:29:51,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:29:51,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:29:51,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:29:51,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:29:51,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:29:51,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:29:51,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:29:51,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:29:51,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:29:51,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:29:51,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:29:51,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:29:51,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:29:51,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:29:51,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:29:51,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:29:51,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:29:51,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:29:51,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:29:51,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:29:51,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:29:51,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:29:51,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:29:51,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:29:51,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:29:51,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:29:51,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:29:51,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:29:51,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:29:51,360 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:29:51,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:29:51,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:29:51,361 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:29:51,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:29:51,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:29:51,362 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:29:51,362 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:29:51,362 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:29:51,363 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:29:51,363 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:29:51,363 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:29:51,363 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:29:51,363 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:29:51,364 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:29:51,364 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:29:51,364 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:29:51,364 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:29:51,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:29:51,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:29:51,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:29:51,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:29:51,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:29:51,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:29:51,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:29:51,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:29:51,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:29:51,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:29:51,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:29:51,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:29:51,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:29:51,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:29:51,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:51,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:29:51,368 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:29:51,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:29:51,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:29:51,369 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:29:51,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:29:51,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:29:51,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:29:51,370 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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2022-11-22 01:29:51,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:29:51,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:29:51,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:29:51,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:29:51,686 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:29:51,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-22 01:29:54,726 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:29:55,083 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:29:55,086 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/sv-benchmarks/c/eca-rers2018/Problem10.c [2022-11-22 01:29:55,108 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/data/27cedf535/adb5195176284d4886899be419c35471/FLAGdb6b040d1 [2022-11-22 01:29:55,134 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/data/27cedf535/adb5195176284d4886899be419c35471 [2022-11-22 01:29:55,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:29:55,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:29:55,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:55,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:29:55,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:29:55,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:55" (1/1) ... [2022-11-22 01:29:55,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b297f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:55, skipping insertion in model container [2022-11-22 01:29:55,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:29:55" (1/1) ... [2022-11-22 01:29:55,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:29:55,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:29:55,367 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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-22 01:29:55,372 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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-22 01:29:55,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:55,932 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:29:55,947 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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-11-22 01:29:55,947 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_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-11-22 01:29:56,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:29:56,130 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:29:56,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56 WrapperNode [2022-11-22 01:29:56,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:29:56,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:56,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:29:56,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:29:56,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,259 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 865 [2022-11-22 01:29:56,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:29:56,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:29:56,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:29:56,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:29:56,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:29:56,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:29:56,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:29:56,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:29:56,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (1/1) ... [2022-11-22 01:29:56,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:29:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:29:56,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:29:56,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:29:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:29:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2022-11-22 01:29:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2022-11-22 01:29:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2022-11-22 01:29:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2022-11-22 01:29:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:29:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:29:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:29:56,628 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:29:56,631 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:29:57,783 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:29:59,874 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:29:59,875 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 01:29:59,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:59 BoogieIcfgContainer [2022-11-22 01:29:59,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:29:59,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:29:59,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:29:59,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:29:59,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:29:55" (1/3) ... [2022-11-22 01:29:59,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:59, skipping insertion in model container [2022-11-22 01:29:59,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:29:56" (2/3) ... [2022-11-22 01:29:59,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657f1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:29:59, skipping insertion in model container [2022-11-22 01:29:59,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:29:59" (3/3) ... [2022-11-22 01:29:59,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2022-11-22 01:29:59,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:29:59,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 01:29:59,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:30:00,006 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;@79d59f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:30:00,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-22 01:30:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 207 states have (on average 1.502415458937198) internal successors, (311), 209 states have internal predecessors, (311), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2022-11-22 01:30:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:30:00,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:00,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:30:00,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1927163450, now seen corresponding path program 1 times [2022-11-22 01:30:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951112400] [2022-11-22 01:30:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:01,692 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-22 01:30:01,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:01,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951112400] [2022-11-22 01:30:01,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951112400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:01,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:01,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247321586] [2022-11-22 01:30:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:01,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:01,755 INFO L87 Difference]: Start difference. First operand has 312 states, 207 states have (on average 1.502415458937198) internal successors, (311), 209 states have internal predecessors, (311), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:02,490 INFO L93 Difference]: Finished difference Result 527 states and 926 transitions. [2022-11-22 01:30:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:30:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:02,508 INFO L225 Difference]: With dead ends: 527 [2022-11-22 01:30:02,508 INFO L226 Difference]: Without dead ends: 212 [2022-11-22 01:30:02,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:02,522 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 291 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:02,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 276 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:30:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-22 01:30:02,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2022-11-22 01:30:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 106 states have (on average 1.9245283018867925) internal successors, (204), 203 states have internal predecessors, (204), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2022-11-22 01:30:02,605 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 6 [2022-11-22 01:30:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:02,605 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2022-11-22 01:30:02,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2022-11-22 01:30:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:30:02,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:02,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:02,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:30:02,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:02,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -388192148, now seen corresponding path program 1 times [2022-11-22 01:30:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:02,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282009499] [2022-11-22 01:30:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:30:04,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:04,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282009499] [2022-11-22 01:30:04,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282009499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:04,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:04,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053081387] [2022-11-22 01:30:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:04,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:04,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:04,744 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:05,310 INFO L93 Difference]: Finished difference Result 210 states and 305 transitions. [2022-11-22 01:30:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 01:30:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:05,314 INFO L225 Difference]: With dead ends: 210 [2022-11-22 01:30:05,314 INFO L226 Difference]: Without dead ends: 206 [2022-11-22 01:30:05,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:05,316 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 296 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:05,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 292 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:30:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-22 01:30:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-11-22 01:30:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 106 states have (on average 1.9056603773584906) internal successors, (202), 201 states have internal predecessors, (202), 96 states have call successors, (96), 2 states have call predecessors, (96), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2022-11-22 01:30:05,334 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 7 [2022-11-22 01:30:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:05,334 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2022-11-22 01:30:05,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2022-11-22 01:30:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:30:05,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:05,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:05,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:30:05,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 850235135, now seen corresponding path program 1 times [2022-11-22 01:30:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024355791] [2022-11-22 01:30:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:08,400 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-22 01:30:08,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024355791] [2022-11-22 01:30:08,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024355791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:08,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:08,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:08,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845375467] [2022-11-22 01:30:08,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:08,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:08,405 INFO L87 Difference]: Start difference. First operand 204 states and 298 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:09,269 INFO L93 Difference]: Finished difference Result 338 states and 525 transitions. [2022-11-22 01:30:09,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:30:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:09,273 INFO L225 Difference]: With dead ends: 338 [2022-11-22 01:30:09,273 INFO L226 Difference]: Without dead ends: 335 [2022-11-22 01:30:09,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:09,281 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 293 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:09,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 129 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:30:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-22 01:30:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 209. [2022-11-22 01:30:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 111 states have (on average 1.864864864864865) internal successors, (207), 206 states have internal predecessors, (207), 96 states have call successors, (96), 2 states have call predecessors, (96), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 303 transitions. [2022-11-22 01:30:09,349 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 303 transitions. Word has length 8 [2022-11-22 01:30:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:09,350 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 303 transitions. [2022-11-22 01:30:09,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 303 transitions. [2022-11-22 01:30:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:30:09,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:09,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:09,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:30:09,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash 586782033, now seen corresponding path program 1 times [2022-11-22 01:30:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:09,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329145666] [2022-11-22 01:30:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:09,991 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-22 01:30:09,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329145666] [2022-11-22 01:30:09,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329145666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:09,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:09,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924419802] [2022-11-22 01:30:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:09,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:09,996 INFO L87 Difference]: Start difference. First operand 209 states and 303 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:10,470 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-11-22 01:30:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:30:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:10,472 INFO L225 Difference]: With dead ends: 215 [2022-11-22 01:30:10,472 INFO L226 Difference]: Without dead ends: 211 [2022-11-22 01:30:10,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:10,473 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 292 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:10,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 268 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-22 01:30:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-11-22 01:30:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 111 states have (on average 1.8468468468468469) internal successors, (205), 204 states have internal predecessors, (205), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-11-22 01:30:10,505 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 9 [2022-11-22 01:30:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-11-22 01:30:10,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-11-22 01:30:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:30:10,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:10,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:30:10,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1009677255, now seen corresponding path program 1 times [2022-11-22 01:30:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860331799] [2022-11-22 01:30:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:12,526 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-22 01:30:12,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:12,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860331799] [2022-11-22 01:30:12,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860331799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:12,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:12,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063181944] [2022-11-22 01:30:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:12,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:12,531 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:13,066 INFO L93 Difference]: Finished difference Result 403 states and 585 transitions. [2022-11-22 01:30:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 01:30:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:13,069 INFO L225 Difference]: With dead ends: 403 [2022-11-22 01:30:13,069 INFO L226 Difference]: Without dead ends: 400 [2022-11-22 01:30:13,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:13,070 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 285 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:13,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 569 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:30:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-22 01:30:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 209. [2022-11-22 01:30:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 113 states have (on average 1.831858407079646) internal successors, (207), 206 states have internal predecessors, (207), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2022-11-22 01:30:13,098 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 10 [2022-11-22 01:30:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:13,098 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2022-11-22 01:30:13,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2022-11-22 01:30:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:30:13,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:13,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:30:13,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1234533942, now seen corresponding path program 1 times [2022-11-22 01:30:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:13,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870012750] [2022-11-22 01:30:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:14,289 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-22 01:30:14,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:14,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870012750] [2022-11-22 01:30:14,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870012750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:14,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:14,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539510509] [2022-11-22 01:30:14,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:14,292 INFO L87 Difference]: Start difference. First operand 209 states and 301 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:15,056 INFO L93 Difference]: Finished difference Result 381 states and 561 transitions. [2022-11-22 01:30:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 01:30:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:15,059 INFO L225 Difference]: With dead ends: 381 [2022-11-22 01:30:15,059 INFO L226 Difference]: Without dead ends: 378 [2022-11-22 01:30:15,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:15,060 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 285 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:15,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 175 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:30:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-22 01:30:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 210. [2022-11-22 01:30:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 114 states have (on average 1.8245614035087718) internal successors, (208), 207 states have internal predecessors, (208), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 302 transitions. [2022-11-22 01:30:15,092 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 302 transitions. Word has length 11 [2022-11-22 01:30:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:15,093 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 302 transitions. [2022-11-22 01:30:15,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 302 transitions. [2022-11-22 01:30:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:30:15,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:15,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:15,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:30:15,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -384836468, now seen corresponding path program 1 times [2022-11-22 01:30:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398317988] [2022-11-22 01:30:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:16,653 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-22 01:30:16,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398317988] [2022-11-22 01:30:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398317988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:16,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:16,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80609791] [2022-11-22 01:30:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:16,656 INFO L87 Difference]: Start difference. First operand 210 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:17,163 INFO L93 Difference]: Finished difference Result 403 states and 582 transitions. [2022-11-22 01:30:17,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:17,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 01:30:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:17,170 INFO L225 Difference]: With dead ends: 403 [2022-11-22 01:30:17,170 INFO L226 Difference]: Without dead ends: 397 [2022-11-22 01:30:17,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:17,173 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 277 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:17,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 564 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-22 01:30:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 282. [2022-11-22 01:30:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 186 states have (on average 1.8709677419354838) internal successors, (348), 279 states have internal predecessors, (348), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 442 transitions. [2022-11-22 01:30:17,206 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 442 transitions. Word has length 12 [2022-11-22 01:30:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:17,207 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 442 transitions. [2022-11-22 01:30:17,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 442 transitions. [2022-11-22 01:30:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:30:17,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:17,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:17,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:30:17,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 954295067, now seen corresponding path program 1 times [2022-11-22 01:30:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147996347] [2022-11-22 01:30:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:17,812 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-22 01:30:17,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147996347] [2022-11-22 01:30:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147996347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:17,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:17,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020950042] [2022-11-22 01:30:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:17,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:17,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:17,814 INFO L87 Difference]: Start difference. First operand 282 states and 442 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:18,364 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2022-11-22 01:30:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:30:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:18,367 INFO L225 Difference]: With dead ends: 404 [2022-11-22 01:30:18,367 INFO L226 Difference]: Without dead ends: 392 [2022-11-22 01:30:18,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:18,369 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 254 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:18,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 558 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:30:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-22 01:30:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 292. [2022-11-22 01:30:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 196 states have (on average 1.8214285714285714) internal successors, (357), 289 states have internal predecessors, (357), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 451 transitions. [2022-11-22 01:30:18,408 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 451 transitions. Word has length 13 [2022-11-22 01:30:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:18,409 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 451 transitions. [2022-11-22 01:30:18,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 451 transitions. [2022-11-22 01:30:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 01:30:18,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:18,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:18,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:30:18,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2066856960, now seen corresponding path program 1 times [2022-11-22 01:30:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:18,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187739188] [2022-11-22 01:30:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:21,515 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-22 01:30:21,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:21,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187739188] [2022-11-22 01:30:21,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187739188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:21,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:21,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:21,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30157083] [2022-11-22 01:30:21,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:21,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:21,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:21,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:21,520 INFO L87 Difference]: Start difference. First operand 292 states and 451 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:22,376 INFO L93 Difference]: Finished difference Result 325 states and 492 transitions. [2022-11-22 01:30:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 01:30:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:22,381 INFO L225 Difference]: With dead ends: 325 [2022-11-22 01:30:22,381 INFO L226 Difference]: Without dead ends: 322 [2022-11-22 01:30:22,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:22,382 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 265 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:22,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 130 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:30:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-22 01:30:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2022-11-22 01:30:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 196 states have (on average 1.816326530612245) internal successors, (356), 289 states have internal predecessors, (356), 94 states have call successors, (94), 2 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2022-11-22 01:30:22,462 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 15 [2022-11-22 01:30:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:22,462 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2022-11-22 01:30:22,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2022-11-22 01:30:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:30:22,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:22,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:22,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:30:22,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 351287827, now seen corresponding path program 1 times [2022-11-22 01:30:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:22,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309418510] [2022-11-22 01:30:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:22,970 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-22 01:30:22,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:22,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309418510] [2022-11-22 01:30:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309418510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:22,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:22,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340152973] [2022-11-22 01:30:22,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:22,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:22,973 INFO L87 Difference]: Start difference. First operand 292 states and 450 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:23,425 INFO L93 Difference]: Finished difference Result 298 states and 453 transitions. [2022-11-22 01:30:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 01:30:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:23,427 INFO L225 Difference]: With dead ends: 298 [2022-11-22 01:30:23,427 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:30:23,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:23,428 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 266 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:23,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 286 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:30:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2022-11-22 01:30:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 196 states have (on average 1.7959183673469388) internal successors, (352), 287 states have internal predecessors, (352), 92 states have call successors, (92), 2 states have call predecessors, (92), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2022-11-22 01:30:23,471 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 16 [2022-11-22 01:30:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:23,472 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2022-11-22 01:30:23,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2022-11-22 01:30:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:30:23,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:23,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:23,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:30:23,474 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1995628315, now seen corresponding path program 1 times [2022-11-22 01:30:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:23,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901072149] [2022-11-22 01:30:23,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:23,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:23,844 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-22 01:30:23,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:23,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901072149] [2022-11-22 01:30:23,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901072149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:23,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:23,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:30:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622568043] [2022-11-22 01:30:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:23,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:30:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:30:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:30:23,847 INFO L87 Difference]: Start difference. First operand 290 states and 444 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:23,940 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2022-11-22 01:30:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:30:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:30:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:23,942 INFO L225 Difference]: With dead ends: 292 [2022-11-22 01:30:23,943 INFO L226 Difference]: Without dead ends: 288 [2022-11-22 01:30:23,943 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-22 01:30:23,944 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 275 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:30:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-22 01:30:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-22 01:30:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 196 states have (on average 1.7755102040816326) internal successors, (348), 285 states have internal predecessors, (348), 90 states have call successors, (90), 2 states have call predecessors, (90), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 438 transitions. [2022-11-22 01:30:23,985 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 438 transitions. Word has length 17 [2022-11-22 01:30:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:23,985 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 438 transitions. [2022-11-22 01:30:23,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 438 transitions. [2022-11-22 01:30:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:30:23,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:23,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:23,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:30:23,987 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1735577896, now seen corresponding path program 1 times [2022-11-22 01:30:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:23,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318602565] [2022-11-22 01:30:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:24,814 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-22 01:30:24,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:24,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318602565] [2022-11-22 01:30:24,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318602565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:24,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:24,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161371855] [2022-11-22 01:30:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:24,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:24,817 INFO L87 Difference]: Start difference. First operand 288 states and 438 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:25,297 INFO L93 Difference]: Finished difference Result 290 states and 439 transitions. [2022-11-22 01:30:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-22 01:30:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:25,299 INFO L225 Difference]: With dead ends: 290 [2022-11-22 01:30:25,299 INFO L226 Difference]: Without dead ends: 287 [2022-11-22 01:30:25,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:25,300 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 271 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:25,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 275 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-22 01:30:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-22 01:30:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 196 states have (on average 1.7653061224489797) internal successors, (346), 284 states have internal predecessors, (346), 89 states have call successors, (89), 2 states have call predecessors, (89), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 435 transitions. [2022-11-22 01:30:25,338 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 435 transitions. Word has length 18 [2022-11-22 01:30:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:25,340 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 435 transitions. [2022-11-22 01:30:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 435 transitions. [2022-11-22 01:30:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:30:25,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:25,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:30:25,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2031024586, now seen corresponding path program 1 times [2022-11-22 01:30:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:25,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181206708] [2022-11-22 01:30:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:26,168 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-22 01:30:26,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:26,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181206708] [2022-11-22 01:30:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181206708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:26,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538703487] [2022-11-22 01:30:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:26,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:26,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:26,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:26,171 INFO L87 Difference]: Start difference. First operand 287 states and 435 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:26,647 INFO L93 Difference]: Finished difference Result 289 states and 436 transitions. [2022-11-22 01:30:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 01:30:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:26,649 INFO L225 Difference]: With dead ends: 289 [2022-11-22 01:30:26,649 INFO L226 Difference]: Without dead ends: 286 [2022-11-22 01:30:26,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:26,650 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 268 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 274 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-22 01:30:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-22 01:30:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 196 states have (on average 1.7551020408163265) internal successors, (344), 283 states have internal predecessors, (344), 88 states have call successors, (88), 2 states have call predecessors, (88), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 432 transitions. [2022-11-22 01:30:26,688 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 432 transitions. Word has length 19 [2022-11-22 01:30:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:26,688 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 432 transitions. [2022-11-22 01:30:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 432 transitions. [2022-11-22 01:30:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:30:26,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:26,689 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] [2022-11-22 01:30:26,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:30:26,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:26,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:26,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1463375971, now seen corresponding path program 1 times [2022-11-22 01:30:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:26,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202473234] [2022-11-22 01:30:26,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:27,550 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-22 01:30:27,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:27,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202473234] [2022-11-22 01:30:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202473234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:27,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:27,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:27,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889756062] [2022-11-22 01:30:27,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:27,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:27,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:27,553 INFO L87 Difference]: Start difference. First operand 286 states and 432 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:28,040 INFO L93 Difference]: Finished difference Result 288 states and 433 transitions. [2022-11-22 01:30:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 01:30:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:28,042 INFO L225 Difference]: With dead ends: 288 [2022-11-22 01:30:28,042 INFO L226 Difference]: Without dead ends: 285 [2022-11-22 01:30:28,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:28,043 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 265 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:28,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 275 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-22 01:30:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-22 01:30:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.7448979591836735) internal successors, (342), 282 states have internal predecessors, (342), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2022-11-22 01:30:28,075 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 20 [2022-11-22 01:30:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:28,075 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2022-11-22 01:30:28,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2022-11-22 01:30:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:30:28,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:28,076 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-22 01:30:28,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:30:28,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1879363247, now seen corresponding path program 1 times [2022-11-22 01:30:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:28,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764597177] [2022-11-22 01:30:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:30,057 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-22 01:30:30,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:30,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764597177] [2022-11-22 01:30:30,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764597177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:30,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:30,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318253219] [2022-11-22 01:30:30,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:30,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:30,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:30,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:30,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:30,059 INFO L87 Difference]: Start difference. First operand 285 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:30,775 INFO L93 Difference]: Finished difference Result 312 states and 463 transitions. [2022-11-22 01:30:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 01:30:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:30,777 INFO L225 Difference]: With dead ends: 312 [2022-11-22 01:30:30,777 INFO L226 Difference]: Without dead ends: 306 [2022-11-22 01:30:30,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:30,778 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 245 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:30,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 117 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:30:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-22 01:30:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 285. [2022-11-22 01:30:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.7346938775510203) internal successors, (340), 282 states have internal predecessors, (340), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2022-11-22 01:30:30,820 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 21 [2022-11-22 01:30:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:30,820 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2022-11-22 01:30:30,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2022-11-22 01:30:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:30:30,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:30,821 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, 1] [2022-11-22 01:30:30,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:30:30,821 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:30,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1869896606, now seen corresponding path program 1 times [2022-11-22 01:30:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:30,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974609329] [2022-11-22 01:30:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:33,293 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-22 01:30:33,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:33,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974609329] [2022-11-22 01:30:33,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974609329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:33,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:33,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:30:33,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96395483] [2022-11-22 01:30:33,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:33,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:30:33,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:30:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:30:33,295 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:34,200 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2022-11-22 01:30:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:30:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 01:30:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:34,207 INFO L225 Difference]: With dead ends: 360 [2022-11-22 01:30:34,207 INFO L226 Difference]: Without dead ends: 355 [2022-11-22 01:30:34,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:30:34,208 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 393 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:34,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 267 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 01:30:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-22 01:30:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 285. [2022-11-22 01:30:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 196 states have (on average 1.719387755102041) internal successors, (337), 282 states have internal predecessors, (337), 87 states have call successors, (87), 2 states have call predecessors, (87), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2022-11-22 01:30:34,246 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 22 [2022-11-22 01:30:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:34,247 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2022-11-22 01:30:34,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2022-11-22 01:30:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 01:30:34,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:34,248 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, 1, 1] [2022-11-22 01:30:34,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:30:34,248 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2132828268, now seen corresponding path program 1 times [2022-11-22 01:30:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:34,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508848651] [2022-11-22 01:30:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:34,919 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-22 01:30:34,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:34,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508848651] [2022-11-22 01:30:34,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508848651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:34,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:34,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459087561] [2022-11-22 01:30:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:34,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:34,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:34,923 INFO L87 Difference]: Start difference. First operand 285 states and 424 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:35,412 INFO L93 Difference]: Finished difference Result 291 states and 427 transitions. [2022-11-22 01:30:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-22 01:30:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:35,414 INFO L225 Difference]: With dead ends: 291 [2022-11-22 01:30:35,415 INFO L226 Difference]: Without dead ends: 288 [2022-11-22 01:30:35,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:35,416 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 247 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:35,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 273 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-22 01:30:35,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-11-22 01:30:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 196 states have (on average 1.7091836734693877) internal successors, (335), 281 states have internal predecessors, (335), 86 states have call successors, (86), 2 states have call predecessors, (86), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 421 transitions. [2022-11-22 01:30:35,469 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 421 transitions. Word has length 23 [2022-11-22 01:30:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:35,470 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 421 transitions. [2022-11-22 01:30:35,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 421 transitions. [2022-11-22 01:30:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 01:30:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:35,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, 1, 1, 1] [2022-11-22 01:30:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:30:35,474 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1693768406, now seen corresponding path program 1 times [2022-11-22 01:30:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808611408] [2022-11-22 01:30:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:38,294 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-22 01:30:38,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:38,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808611408] [2022-11-22 01:30:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808611408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:38,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:38,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102860090] [2022-11-22 01:30:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:38,298 INFO L87 Difference]: Start difference. First operand 284 states and 421 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:39,039 INFO L93 Difference]: Finished difference Result 320 states and 466 transitions. [2022-11-22 01:30:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 01:30:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:39,042 INFO L225 Difference]: With dead ends: 320 [2022-11-22 01:30:39,042 INFO L226 Difference]: Without dead ends: 317 [2022-11-22 01:30:39,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:39,043 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 231 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:39,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 143 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:30:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-22 01:30:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2022-11-22 01:30:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 196 states have (on average 1.7040816326530612) internal successors, (334), 281 states have internal predecessors, (334), 86 states have call successors, (86), 2 states have call predecessors, (86), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 420 transitions. [2022-11-22 01:30:39,094 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 420 transitions. Word has length 24 [2022-11-22 01:30:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:39,095 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 420 transitions. [2022-11-22 01:30:39,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 420 transitions. [2022-11-22 01:30:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 01:30:39,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:39,096 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, 1, 1, 1, 1] [2022-11-22 01:30:39,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:30:39,096 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -967807879, now seen corresponding path program 1 times [2022-11-22 01:30:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:39,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762455391] [2022-11-22 01:30:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:39,805 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-22 01:30:39,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:39,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762455391] [2022-11-22 01:30:39,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762455391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:39,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:39,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486131921] [2022-11-22 01:30:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:39,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:39,807 INFO L87 Difference]: Start difference. First operand 284 states and 420 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:40,262 INFO L93 Difference]: Finished difference Result 286 states and 421 transitions. [2022-11-22 01:30:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:40,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 01:30:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:40,264 INFO L225 Difference]: With dead ends: 286 [2022-11-22 01:30:40,264 INFO L226 Difference]: Without dead ends: 283 [2022-11-22 01:30:40,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:40,265 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 256 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:40,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 270 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-22 01:30:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-22 01:30:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 196 states have (on average 1.6938775510204083) internal successors, (332), 280 states have internal predecessors, (332), 85 states have call successors, (85), 2 states have call predecessors, (85), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2022-11-22 01:30:40,314 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 25 [2022-11-22 01:30:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:40,314 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2022-11-22 01:30:40,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2022-11-22 01:30:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 01:30:40,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:40,315 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, 1, 1, 1, 1, 1] [2022-11-22 01:30:40,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:30:40,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 62138860, now seen corresponding path program 1 times [2022-11-22 01:30:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426541761] [2022-11-22 01:30:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:43,338 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-22 01:30:43,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426541761] [2022-11-22 01:30:43,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426541761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:43,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:43,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607655407] [2022-11-22 01:30:43,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:43,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:43,341 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:43,851 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2022-11-22 01:30:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-22 01:30:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:43,852 INFO L225 Difference]: With dead ends: 285 [2022-11-22 01:30:43,853 INFO L226 Difference]: Without dead ends: 280 [2022-11-22 01:30:43,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:43,854 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 249 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:43,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-22 01:30:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-22 01:30:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 277 states have internal predecessors, (327), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2022-11-22 01:30:43,933 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 409 transitions. Word has length 26 [2022-11-22 01:30:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:43,934 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 409 transitions. [2022-11-22 01:30:43,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-11-22 01:30:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 01:30:43,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:43,935 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, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 01:30:43,935 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1925723486, now seen corresponding path program 1 times [2022-11-22 01:30:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328046933] [2022-11-22 01:30:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:46,008 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-22 01:30:46,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328046933] [2022-11-22 01:30:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328046933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:46,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:46,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:46,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38841817] [2022-11-22 01:30:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:46,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:46,010 INFO L87 Difference]: Start difference. First operand 280 states and 409 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:46,745 INFO L93 Difference]: Finished difference Result 341 states and 479 transitions. [2022-11-22 01:30:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-22 01:30:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:46,747 INFO L225 Difference]: With dead ends: 341 [2022-11-22 01:30:46,747 INFO L226 Difference]: Without dead ends: 338 [2022-11-22 01:30:46,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:46,748 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 214 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:46,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 164 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:30:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-22 01:30:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 280. [2022-11-22 01:30:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.663265306122449) internal successors, (326), 277 states have internal predecessors, (326), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2022-11-22 01:30:46,795 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 27 [2022-11-22 01:30:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:46,795 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2022-11-22 01:30:46,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-11-22 01:30:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 01:30:46,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:46,796 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:46,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 01:30:46,797 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -432688463, now seen corresponding path program 1 times [2022-11-22 01:30:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465771132] [2022-11-22 01:30:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:48,632 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-22 01:30:48,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:48,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465771132] [2022-11-22 01:30:48,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465771132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:48,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:48,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:48,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217851427] [2022-11-22 01:30:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:48,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:48,634 INFO L87 Difference]: Start difference. First operand 280 states and 408 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:49,334 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2022-11-22 01:30:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-22 01:30:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:49,337 INFO L225 Difference]: With dead ends: 307 [2022-11-22 01:30:49,337 INFO L226 Difference]: Without dead ends: 304 [2022-11-22 01:30:49,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:49,339 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 219 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 124 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:30:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-22 01:30:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2022-11-22 01:30:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6581632653061225) internal successors, (325), 277 states have internal predecessors, (325), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 407 transitions. [2022-11-22 01:30:49,406 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 407 transitions. Word has length 28 [2022-11-22 01:30:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:49,406 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 407 transitions. [2022-11-22 01:30:49,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-11-22 01:30:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 01:30:49,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:49,407 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 01:30:49,408 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -529008058, now seen corresponding path program 1 times [2022-11-22 01:30:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:49,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936132270] [2022-11-22 01:30:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:53,127 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-22 01:30:53,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:53,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936132270] [2022-11-22 01:30:53,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936132270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:53,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:53,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917069360] [2022-11-22 01:30:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:53,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:53,130 INFO L87 Difference]: Start difference. First operand 280 states and 407 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:53,947 INFO L93 Difference]: Finished difference Result 318 states and 454 transitions. [2022-11-22 01:30:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-22 01:30:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:53,949 INFO L225 Difference]: With dead ends: 318 [2022-11-22 01:30:53,949 INFO L226 Difference]: Without dead ends: 315 [2022-11-22 01:30:53,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:53,951 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 215 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:53,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 138 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 01:30:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-22 01:30:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2022-11-22 01:30:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.653061224489796) internal successors, (324), 277 states have internal predecessors, (324), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 406 transitions. [2022-11-22 01:30:54,008 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 406 transitions. Word has length 29 [2022-11-22 01:30:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:54,009 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 406 transitions. [2022-11-22 01:30:54,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 406 transitions. [2022-11-22 01:30:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 01:30:54,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:54,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:54,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-22 01:30:54,010 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash 780058486, now seen corresponding path program 1 times [2022-11-22 01:30:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:54,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639462443] [2022-11-22 01:30:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:55,893 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-22 01:30:55,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639462443] [2022-11-22 01:30:55,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639462443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:55,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:55,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966157011] [2022-11-22 01:30:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:55,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:55,897 INFO L87 Difference]: Start difference. First operand 280 states and 406 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:56,461 INFO L93 Difference]: Finished difference Result 350 states and 485 transitions. [2022-11-22 01:30:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-22 01:30:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:56,463 INFO L225 Difference]: With dead ends: 350 [2022-11-22 01:30:56,463 INFO L226 Difference]: Without dead ends: 347 [2022-11-22 01:30:56,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:56,465 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 198 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:56,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 481 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-22 01:30:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 280. [2022-11-22 01:30:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.6479591836734695) internal successors, (323), 277 states have internal predecessors, (323), 82 states have call successors, (82), 2 states have call predecessors, (82), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 405 transitions. [2022-11-22 01:30:56,520 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 405 transitions. Word has length 30 [2022-11-22 01:30:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:56,520 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 405 transitions. [2022-11-22 01:30:56,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 405 transitions. [2022-11-22 01:30:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 01:30:56,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:56,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:56,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-22 01:30:56,521 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1588544728, now seen corresponding path program 1 times [2022-11-22 01:30:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:56,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476567999] [2022-11-22 01:30:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:30:57,247 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-22 01:30:57,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:30:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476567999] [2022-11-22 01:30:57,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476567999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:30:57,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:30:57,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:30:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391757476] [2022-11-22 01:30:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:30:57,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:30:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:30:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:30:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:57,251 INFO L87 Difference]: Start difference. First operand 280 states and 405 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:30:57,702 INFO L93 Difference]: Finished difference Result 282 states and 406 transitions. [2022-11-22 01:30:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:30:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-22 01:30:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:30:57,708 INFO L225 Difference]: With dead ends: 282 [2022-11-22 01:30:57,708 INFO L226 Difference]: Without dead ends: 279 [2022-11-22 01:30:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:30:57,709 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 242 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:30:57,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 263 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:30:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-22 01:30:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-22 01:30:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 196 states have (on average 1.6377551020408163) internal successors, (321), 276 states have internal predecessors, (321), 81 states have call successors, (81), 2 states have call predecessors, (81), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2022-11-22 01:30:57,765 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 31 [2022-11-22 01:30:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:30:57,765 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2022-11-22 01:30:57,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:30:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2022-11-22 01:30:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 01:30:57,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:30:57,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:30:57,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-22 01:30:57,767 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:30:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:30:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1365468416, now seen corresponding path program 1 times [2022-11-22 01:30:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:30:57,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542624057] [2022-11-22 01:30:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:30:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:30:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:00,367 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-22 01:31:00,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:00,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542624057] [2022-11-22 01:31:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542624057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:00,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:00,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107232410] [2022-11-22 01:31:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:00,370 INFO L87 Difference]: Start difference. First operand 279 states and 402 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:01,105 INFO L93 Difference]: Finished difference Result 306 states and 438 transitions. [2022-11-22 01:31:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:01,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-22 01:31:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:01,107 INFO L225 Difference]: With dead ends: 306 [2022-11-22 01:31:01,107 INFO L226 Difference]: Without dead ends: 303 [2022-11-22 01:31:01,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:01,108 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 206 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:01,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 135 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-22 01:31:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 279. [2022-11-22 01:31:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 276 states have internal predecessors, (320), 81 states have call successors, (81), 2 states have call predecessors, (81), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 401 transitions. [2022-11-22 01:31:01,187 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 401 transitions. Word has length 34 [2022-11-22 01:31:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:01,188 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 401 transitions. [2022-11-22 01:31:01,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 401 transitions. [2022-11-22 01:31:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 01:31:01,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:01,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:01,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 01:31:01,189 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -620678926, now seen corresponding path program 1 times [2022-11-22 01:31:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:01,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206872882] [2022-11-22 01:31:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:03,390 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-22 01:31:03,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:03,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206872882] [2022-11-22 01:31:03,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206872882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:03,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:03,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:31:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685332124] [2022-11-22 01:31:03,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:03,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:31:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:31:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:03,392 INFO L87 Difference]: Start difference. First operand 279 states and 401 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:03,897 INFO L93 Difference]: Finished difference Result 281 states and 402 transitions. [2022-11-22 01:31:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-22 01:31:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:03,899 INFO L225 Difference]: With dead ends: 281 [2022-11-22 01:31:03,899 INFO L226 Difference]: Without dead ends: 278 [2022-11-22 01:31:03,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:03,900 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 265 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:03,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 252 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:31:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-22 01:31:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-22 01:31:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 196 states have (on average 1.6224489795918366) internal successors, (318), 275 states have internal predecessors, (318), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 398 transitions. [2022-11-22 01:31:03,972 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 398 transitions. Word has length 35 [2022-11-22 01:31:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:03,973 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 398 transitions. [2022-11-22 01:31:03,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2022-11-22 01:31:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-22 01:31:03,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:03,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-22 01:31:03,974 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:03,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 511370714, now seen corresponding path program 1 times [2022-11-22 01:31:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595362096] [2022-11-22 01:31:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:06,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-22 01:31:06,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:06,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595362096] [2022-11-22 01:31:06,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595362096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:06,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:06,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238030335] [2022-11-22 01:31:06,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:06,425 INFO L87 Difference]: Start difference. First operand 278 states and 398 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:07,142 INFO L93 Difference]: Finished difference Result 312 states and 440 transitions. [2022-11-22 01:31:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-22 01:31:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:07,144 INFO L225 Difference]: With dead ends: 312 [2022-11-22 01:31:07,144 INFO L226 Difference]: Without dead ends: 305 [2022-11-22 01:31:07,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:07,145 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 195 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:07,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 136 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-22 01:31:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-11-22 01:31:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 199 states have (on average 1.6130653266331658) internal successors, (321), 278 states have internal predecessors, (321), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2022-11-22 01:31:07,230 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 37 [2022-11-22 01:31:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:07,230 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2022-11-22 01:31:07,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2022-11-22 01:31:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 01:31:07,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:07,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-22 01:31:07,232 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1327883638, now seen corresponding path program 1 times [2022-11-22 01:31:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322538286] [2022-11-22 01:31:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:10,208 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-22 01:31:10,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:10,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322538286] [2022-11-22 01:31:10,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322538286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:10,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:10,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439174987] [2022-11-22 01:31:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:10,210 INFO L87 Difference]: Start difference. First operand 281 states and 401 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:10,905 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2022-11-22 01:31:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-22 01:31:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:10,907 INFO L225 Difference]: With dead ends: 308 [2022-11-22 01:31:10,907 INFO L226 Difference]: Without dead ends: 305 [2022-11-22 01:31:10,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:10,908 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 190 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 153 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-22 01:31:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-11-22 01:31:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 278 states have internal predecessors, (320), 80 states have call successors, (80), 2 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2022-11-22 01:31:10,970 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 38 [2022-11-22 01:31:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:10,970 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2022-11-22 01:31:10,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2022-11-22 01:31:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-22 01:31:10,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:10,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-22 01:31:10,972 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1784780476, now seen corresponding path program 1 times [2022-11-22 01:31:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:10,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750399526] [2022-11-22 01:31:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:13,419 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-22 01:31:13,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:13,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750399526] [2022-11-22 01:31:13,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750399526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:13,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:13,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:31:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137085334] [2022-11-22 01:31:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:13,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:31:13,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:31:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:13,421 INFO L87 Difference]: Start difference. First operand 281 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:14,038 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2022-11-22 01:31:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:14,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-22 01:31:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:14,040 INFO L225 Difference]: With dead ends: 283 [2022-11-22 01:31:14,040 INFO L226 Difference]: Without dead ends: 280 [2022-11-22 01:31:14,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:14,041 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 263 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:14,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 85 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-22 01:31:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-22 01:31:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 277 states have internal predecessors, (318), 79 states have call successors, (79), 2 states have call predecessors, (79), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 397 transitions. [2022-11-22 01:31:14,150 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 397 transitions. Word has length 39 [2022-11-22 01:31:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:14,150 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 397 transitions. [2022-11-22 01:31:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 397 transitions. [2022-11-22 01:31:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 01:31:14,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:14,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:14,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-22 01:31:14,152 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -506873009, now seen corresponding path program 1 times [2022-11-22 01:31:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:14,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693360699] [2022-11-22 01:31:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:14,288 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-22 01:31:14,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:14,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693360699] [2022-11-22 01:31:14,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693360699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:14,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:14,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:31:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139940297] [2022-11-22 01:31:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:14,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:31:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:14,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:31:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:31:14,290 INFO L87 Difference]: Start difference. First operand 280 states and 397 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:14,412 INFO L93 Difference]: Finished difference Result 282 states and 398 transitions. [2022-11-22 01:31:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:31:14,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-22 01:31:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:14,414 INFO L225 Difference]: With dead ends: 282 [2022-11-22 01:31:14,414 INFO L226 Difference]: Without dead ends: 278 [2022-11-22 01:31:14,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:31:14,415 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:14,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:31:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-22 01:31:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-22 01:31:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 275 states have internal predecessors, (315), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 392 transitions. [2022-11-22 01:31:14,469 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 392 transitions. Word has length 40 [2022-11-22 01:31:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:14,469 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 392 transitions. [2022-11-22 01:31:14,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 392 transitions. [2022-11-22 01:31:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 01:31:14,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:14,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:14,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-22 01:31:14,470 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1466319777, now seen corresponding path program 1 times [2022-11-22 01:31:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:14,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008615991] [2022-11-22 01:31:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:16,130 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-22 01:31:16,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008615991] [2022-11-22 01:31:16,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008615991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:16,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:16,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257310528] [2022-11-22 01:31:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:16,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:16,133 INFO L87 Difference]: Start difference. First operand 278 states and 392 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:16,855 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2022-11-22 01:31:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-22 01:31:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:16,857 INFO L225 Difference]: With dead ends: 306 [2022-11-22 01:31:16,857 INFO L226 Difference]: Without dead ends: 298 [2022-11-22 01:31:16,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:16,860 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 182 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:16,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 132 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-22 01:31:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 281. [2022-11-22 01:31:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5544554455445545) internal successors, (314), 278 states have internal predecessors, (314), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2022-11-22 01:31:16,954 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 41 [2022-11-22 01:31:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:16,955 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2022-11-22 01:31:16,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2022-11-22 01:31:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 01:31:16,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:16,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-22 01:31:16,956 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 368700550, now seen corresponding path program 1 times [2022-11-22 01:31:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228419014] [2022-11-22 01:31:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:19,645 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-22 01:31:19,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228419014] [2022-11-22 01:31:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228419014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:19,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:19,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:31:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940496817] [2022-11-22 01:31:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:31:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:31:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:19,647 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:20,407 INFO L93 Difference]: Finished difference Result 321 states and 433 transitions. [2022-11-22 01:31:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:31:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-22 01:31:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:20,409 INFO L225 Difference]: With dead ends: 321 [2022-11-22 01:31:20,409 INFO L226 Difference]: Without dead ends: 318 [2022-11-22 01:31:20,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:31:20,410 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 306 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:20,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 171 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-22 01:31:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2022-11-22 01:31:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5495049504950495) internal successors, (313), 278 states have internal predecessors, (313), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2022-11-22 01:31:20,464 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 43 [2022-11-22 01:31:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:20,464 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2022-11-22 01:31:20,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2022-11-22 01:31:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 01:31:20,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:20,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:20,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-22 01:31:20,466 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1455650596, now seen corresponding path program 1 times [2022-11-22 01:31:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:20,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590517833] [2022-11-22 01:31:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:22,764 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-22 01:31:22,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590517833] [2022-11-22 01:31:22,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590517833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:22,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:22,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872691012] [2022-11-22 01:31:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:22,766 INFO L87 Difference]: Start difference. First operand 281 states and 390 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:23,289 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-11-22 01:31:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-22 01:31:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:23,291 INFO L225 Difference]: With dead ends: 330 [2022-11-22 01:31:23,291 INFO L226 Difference]: Without dead ends: 327 [2022-11-22 01:31:23,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:23,292 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 153 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:23,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 442 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:31:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-22 01:31:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 281. [2022-11-22 01:31:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.5445544554455446) internal successors, (312), 278 states have internal predecessors, (312), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 389 transitions. [2022-11-22 01:31:23,378 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 389 transitions. Word has length 44 [2022-11-22 01:31:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:23,378 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 389 transitions. [2022-11-22 01:31:23,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 389 transitions. [2022-11-22 01:31:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 01:31:23,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:23,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-22 01:31:23,379 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1264432542, now seen corresponding path program 1 times [2022-11-22 01:31:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202768704] [2022-11-22 01:31:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:25,703 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-22 01:31:25,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:25,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202768704] [2022-11-22 01:31:25,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202768704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:25,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:25,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232654136] [2022-11-22 01:31:25,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:25,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:25,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:25,705 INFO L87 Difference]: Start difference. First operand 281 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:26,351 INFO L93 Difference]: Finished difference Result 310 states and 420 transitions. [2022-11-22 01:31:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-22 01:31:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:26,353 INFO L225 Difference]: With dead ends: 310 [2022-11-22 01:31:26,353 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:31:26,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:26,354 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 152 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:26,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 153 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:31:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2022-11-22 01:31:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 208 states have (on average 1.5) internal successors, (312), 284 states have internal predecessors, (312), 77 states have call successors, (77), 2 states have call predecessors, (77), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 389 transitions. [2022-11-22 01:31:26,431 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 389 transitions. Word has length 46 [2022-11-22 01:31:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:26,432 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 389 transitions. [2022-11-22 01:31:26,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 389 transitions. [2022-11-22 01:31:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-22 01:31:26,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:26,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:26,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-22 01:31:26,433 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:26,434 INFO L85 PathProgramCache]: Analyzing trace with hash -370317725, now seen corresponding path program 1 times [2022-11-22 01:31:26,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:26,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270648796] [2022-11-22 01:31:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:27,172 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-22 01:31:27,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:27,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270648796] [2022-11-22 01:31:27,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270648796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:27,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347705133] [2022-11-22 01:31:27,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:27,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:27,174 INFO L87 Difference]: Start difference. First operand 287 states and 389 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:27,591 INFO L93 Difference]: Finished difference Result 293 states and 392 transitions. [2022-11-22 01:31:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:27,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-22 01:31:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:27,593 INFO L225 Difference]: With dead ends: 293 [2022-11-22 01:31:27,593 INFO L226 Difference]: Without dead ends: 288 [2022-11-22 01:31:27,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:27,594 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 214 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:27,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 240 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:31:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-22 01:31:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-11-22 01:31:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.4807692307692308) internal successors, (308), 281 states have internal predecessors, (308), 74 states have call successors, (74), 2 states have call predecessors, (74), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 382 transitions. [2022-11-22 01:31:27,673 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 382 transitions. Word has length 48 [2022-11-22 01:31:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:27,673 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 382 transitions. [2022-11-22 01:31:27,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 382 transitions. [2022-11-22 01:31:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 01:31:27,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:27,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:27,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-22 01:31:27,675 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1207068698, now seen corresponding path program 1 times [2022-11-22 01:31:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:27,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150869275] [2022-11-22 01:31:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:30,448 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-22 01:31:30,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:30,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150869275] [2022-11-22 01:31:30,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150869275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:30,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:30,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977160628] [2022-11-22 01:31:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:30,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:30,450 INFO L87 Difference]: Start difference. First operand 284 states and 382 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:31,198 INFO L93 Difference]: Finished difference Result 315 states and 410 transitions. [2022-11-22 01:31:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:31,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-22 01:31:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:31,200 INFO L225 Difference]: With dead ends: 315 [2022-11-22 01:31:31,200 INFO L226 Difference]: Without dead ends: 312 [2022-11-22 01:31:31,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:31,201 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 134 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:31,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 203 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 01:31:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-22 01:31:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2022-11-22 01:31:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.4759615384615385) internal successors, (307), 281 states have internal predecessors, (307), 74 states have call successors, (74), 2 states have call predecessors, (74), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 381 transitions. [2022-11-22 01:31:31,281 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 381 transitions. Word has length 51 [2022-11-22 01:31:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:31,281 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 381 transitions. [2022-11-22 01:31:31,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-11-22 01:31:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 01:31:31,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:31,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:31,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-22 01:31:31,283 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1235987475, now seen corresponding path program 1 times [2022-11-22 01:31:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:31,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562842980] [2022-11-22 01:31:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:31,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:31,420 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-22 01:31:31,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:31,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562842980] [2022-11-22 01:31:31,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562842980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:31,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:31,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:31:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131409223] [2022-11-22 01:31:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:31:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:31:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:31:31,423 INFO L87 Difference]: Start difference. First operand 284 states and 381 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:31,557 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2022-11-22 01:31:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:31:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-22 01:31:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:31,559 INFO L225 Difference]: With dead ends: 286 [2022-11-22 01:31:31,559 INFO L226 Difference]: Without dead ends: 281 [2022-11-22 01:31:31,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:31:31,560 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 240 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:31:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-22 01:31:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-22 01:31:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 208 states have (on average 1.4471153846153846) internal successors, (301), 278 states have internal predecessors, (301), 71 states have call successors, (71), 2 states have call predecessors, (71), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2022-11-22 01:31:31,635 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 52 [2022-11-22 01:31:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:31,636 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2022-11-22 01:31:31,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2022-11-22 01:31:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-22 01:31:31,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:31,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-22 01:31:31,637 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1909035186, now seen corresponding path program 1 times [2022-11-22 01:31:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:31,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533190838] [2022-11-22 01:31:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:32,787 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-22 01:31:32,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:32,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533190838] [2022-11-22 01:31:32,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533190838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:32,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:32,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:32,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159873107] [2022-11-22 01:31:32,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:32,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:32,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:32,790 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:32,950 INFO L93 Difference]: Finished difference Result 283 states and 373 transitions. [2022-11-22 01:31:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:31:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-22 01:31:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:32,952 INFO L225 Difference]: With dead ends: 283 [2022-11-22 01:31:32,952 INFO L226 Difference]: Without dead ends: 280 [2022-11-22 01:31:32,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:32,956 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:32,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 230 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:31:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-22 01:31:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-22 01:31:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 208 states have (on average 1.4375) internal successors, (299), 277 states have internal predecessors, (299), 70 states have call successors, (70), 2 states have call predecessors, (70), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 369 transitions. [2022-11-22 01:31:33,030 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 369 transitions. Word has length 54 [2022-11-22 01:31:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:33,030 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 369 transitions. [2022-11-22 01:31:33,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 369 transitions. [2022-11-22 01:31:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-22 01:31:33,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:33,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:33,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-22 01:31:33,031 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -949842460, now seen corresponding path program 1 times [2022-11-22 01:31:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:33,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360502240] [2022-11-22 01:31:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:36,355 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-22 01:31:36,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360502240] [2022-11-22 01:31:36,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360502240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:36,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:36,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566794574] [2022-11-22 01:31:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:36,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:36,357 INFO L87 Difference]: Start difference. First operand 280 states and 369 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:36,844 INFO L93 Difference]: Finished difference Result 282 states and 370 transitions. [2022-11-22 01:31:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-22 01:31:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:36,846 INFO L225 Difference]: With dead ends: 282 [2022-11-22 01:31:36,846 INFO L226 Difference]: Without dead ends: 277 [2022-11-22 01:31:36,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:36,847 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 190 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:36,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 73 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:31:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-22 01:31:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-11-22 01:31:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.4086538461538463) internal successors, (293), 274 states have internal predecessors, (293), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 360 transitions. [2022-11-22 01:31:36,895 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 360 transitions. Word has length 55 [2022-11-22 01:31:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:36,895 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 360 transitions. [2022-11-22 01:31:36,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 360 transitions. [2022-11-22 01:31:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-22 01:31:36,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:36,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:36,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-22 01:31:36,896 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1428857774, now seen corresponding path program 1 times [2022-11-22 01:31:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:36,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726651028] [2022-11-22 01:31:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:38,812 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-22 01:31:38,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:38,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726651028] [2022-11-22 01:31:38,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726651028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:38,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:38,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910487836] [2022-11-22 01:31:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:38,814 INFO L87 Difference]: Start difference. First operand 277 states and 360 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:39,254 INFO L93 Difference]: Finished difference Result 297 states and 377 transitions. [2022-11-22 01:31:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-22 01:31:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:39,257 INFO L225 Difference]: With dead ends: 297 [2022-11-22 01:31:39,257 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:31:39,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:39,258 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 95 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:39,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 367 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:31:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:31:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-11-22 01:31:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 274 states have internal predecessors, (292), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 359 transitions. [2022-11-22 01:31:39,327 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 359 transitions. Word has length 59 [2022-11-22 01:31:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:39,327 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 359 transitions. [2022-11-22 01:31:39,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 359 transitions. [2022-11-22 01:31:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-22 01:31:39,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:39,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-22 01:31:39,328 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064462, now seen corresponding path program 1 times [2022-11-22 01:31:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545104139] [2022-11-22 01:31:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:41,187 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-22 01:31:41,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:41,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545104139] [2022-11-22 01:31:41,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545104139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:41,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:41,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895128070] [2022-11-22 01:31:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:41,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:41,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:41,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:41,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:41,189 INFO L87 Difference]: Start difference. First operand 277 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:41,809 INFO L93 Difference]: Finished difference Result 301 states and 379 transitions. [2022-11-22 01:31:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-11-22 01:31:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:41,810 INFO L225 Difference]: With dead ends: 301 [2022-11-22 01:31:41,811 INFO L226 Difference]: Without dead ends: 294 [2022-11-22 01:31:41,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:41,811 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 94 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:41,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 207 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-22 01:31:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-11-22 01:31:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.3894230769230769) internal successors, (289), 274 states have internal predecessors, (289), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 356 transitions. [2022-11-22 01:31:41,862 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 356 transitions. Word has length 64 [2022-11-22 01:31:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:41,863 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 356 transitions. [2022-11-22 01:31:41,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 356 transitions. [2022-11-22 01:31:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-22 01:31:41,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:41,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:41,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-22 01:31:41,864 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1401761456, now seen corresponding path program 1 times [2022-11-22 01:31:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579153117] [2022-11-22 01:31:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:44,035 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-22 01:31:44,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579153117] [2022-11-22 01:31:44,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579153117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:44,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935405285] [2022-11-22 01:31:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:44,038 INFO L87 Difference]: Start difference. First operand 277 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:44,650 INFO L93 Difference]: Finished difference Result 290 states and 366 transitions. [2022-11-22 01:31:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-11-22 01:31:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:44,653 INFO L225 Difference]: With dead ends: 290 [2022-11-22 01:31:44,653 INFO L226 Difference]: Without dead ends: 287 [2022-11-22 01:31:44,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:44,654 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 115 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:44,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 143 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-22 01:31:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2022-11-22 01:31:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 274 states have internal predecessors, (288), 67 states have call successors, (67), 2 states have call predecessors, (67), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2022-11-22 01:31:44,706 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 66 [2022-11-22 01:31:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:44,706 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2022-11-22 01:31:44,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-11-22 01:31:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-22 01:31:44,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:44,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:44,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-22 01:31:44,707 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -505241790, now seen corresponding path program 1 times [2022-11-22 01:31:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:44,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881769883] [2022-11-22 01:31:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:45,599 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-22 01:31:45,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881769883] [2022-11-22 01:31:45,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881769883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:45,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:45,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:45,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781716165] [2022-11-22 01:31:45,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:45,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:45,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:45,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:45,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:45,602 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:46,080 INFO L93 Difference]: Finished difference Result 279 states and 356 transitions. [2022-11-22 01:31:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-11-22 01:31:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:46,082 INFO L225 Difference]: With dead ends: 279 [2022-11-22 01:31:46,083 INFO L226 Difference]: Without dead ends: 276 [2022-11-22 01:31:46,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:46,083 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 176 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:46,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 233 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:31:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-22 01:31:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-11-22 01:31:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.375) internal successors, (286), 273 states have internal predecessors, (286), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 352 transitions. [2022-11-22 01:31:46,138 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 352 transitions. Word has length 67 [2022-11-22 01:31:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:46,139 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 352 transitions. [2022-11-22 01:31:46,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 352 transitions. [2022-11-22 01:31:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-22 01:31:46,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:46,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:46,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-22 01:31:46,141 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1901725405, now seen corresponding path program 1 times [2022-11-22 01:31:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:46,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375152297] [2022-11-22 01:31:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:48,363 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-22 01:31:48,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:48,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375152297] [2022-11-22 01:31:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375152297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:48,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:48,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713841743] [2022-11-22 01:31:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:48,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:48,366 INFO L87 Difference]: Start difference. First operand 276 states and 352 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:49,044 INFO L93 Difference]: Finished difference Result 292 states and 365 transitions. [2022-11-22 01:31:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-22 01:31:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:49,048 INFO L225 Difference]: With dead ends: 292 [2022-11-22 01:31:49,048 INFO L226 Difference]: Without dead ends: 289 [2022-11-22 01:31:49,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:49,049 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 111 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:49,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 143 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-22 01:31:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2022-11-22 01:31:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.3701923076923077) internal successors, (285), 273 states have internal predecessors, (285), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 351 transitions. [2022-11-22 01:31:49,145 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 351 transitions. Word has length 70 [2022-11-22 01:31:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:49,145 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 351 transitions. [2022-11-22 01:31:49,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 351 transitions. [2022-11-22 01:31:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-22 01:31:49,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:49,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:49,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-22 01:31:49,147 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -892407311, now seen corresponding path program 1 times [2022-11-22 01:31:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:49,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541114153] [2022-11-22 01:31:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:49,897 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-22 01:31:49,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541114153] [2022-11-22 01:31:49,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541114153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:49,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:49,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072844254] [2022-11-22 01:31:49,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:49,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:49,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:49,900 INFO L87 Difference]: Start difference. First operand 276 states and 351 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:50,232 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2022-11-22 01:31:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-22 01:31:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:50,248 INFO L225 Difference]: With dead ends: 296 [2022-11-22 01:31:50,249 INFO L226 Difference]: Without dead ends: 290 [2022-11-22 01:31:50,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:50,250 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 55 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:50,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 464 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:31:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-22 01:31:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2022-11-22 01:31:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 208 states have (on average 1.3605769230769231) internal successors, (283), 273 states have internal predecessors, (283), 66 states have call successors, (66), 2 states have call predecessors, (66), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 349 transitions. [2022-11-22 01:31:50,347 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 349 transitions. Word has length 73 [2022-11-22 01:31:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 349 transitions. [2022-11-22 01:31:50,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 349 transitions. [2022-11-22 01:31:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-22 01:31:50,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:50,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:50,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-22 01:31:50,349 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:50,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:50,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1895084956, now seen corresponding path program 1 times [2022-11-22 01:31:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:50,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455821670] [2022-11-22 01:31:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:52,455 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-22 01:31:52,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:52,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455821670] [2022-11-22 01:31:52,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455821670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:52,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:52,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717115892] [2022-11-22 01:31:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:52,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:52,457 INFO L87 Difference]: Start difference. First operand 276 states and 349 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:52,912 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2022-11-22 01:31:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-22 01:31:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:52,914 INFO L225 Difference]: With dead ends: 278 [2022-11-22 01:31:52,914 INFO L226 Difference]: Without dead ends: 275 [2022-11-22 01:31:52,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:52,915 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 167 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:52,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 222 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 01:31:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-22 01:31:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-11-22 01:31:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 272 states have internal predecessors, (281), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 346 transitions. [2022-11-22 01:31:52,975 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 346 transitions. Word has length 74 [2022-11-22 01:31:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:52,975 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 346 transitions. [2022-11-22 01:31:52,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 346 transitions. [2022-11-22 01:31:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-22 01:31:52,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:52,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-22 01:31:52,976 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1587511931, now seen corresponding path program 1 times [2022-11-22 01:31:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218906223] [2022-11-22 01:31:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:55,129 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-22 01:31:55,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:55,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218906223] [2022-11-22 01:31:55,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218906223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:55,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:55,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:55,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569998737] [2022-11-22 01:31:55,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:55,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:55,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:55,132 INFO L87 Difference]: Start difference. First operand 275 states and 346 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:55,714 INFO L93 Difference]: Finished difference Result 289 states and 357 transitions. [2022-11-22 01:31:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-22 01:31:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:55,716 INFO L225 Difference]: With dead ends: 289 [2022-11-22 01:31:55,716 INFO L226 Difference]: Without dead ends: 282 [2022-11-22 01:31:55,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:55,717 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 88 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:55,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:31:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-22 01:31:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-11-22 01:31:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3269230769230769) internal successors, (276), 272 states have internal predecessors, (276), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 341 transitions. [2022-11-22 01:31:55,772 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 341 transitions. Word has length 81 [2022-11-22 01:31:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:55,772 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 341 transitions. [2022-11-22 01:31:55,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 341 transitions. [2022-11-22 01:31:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-22 01:31:55,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:55,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:55,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-22 01:31:55,773 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1079023560, now seen corresponding path program 1 times [2022-11-22 01:31:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:55,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494789759] [2022-11-22 01:31:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:31:57,708 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-22 01:31:57,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:31:57,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494789759] [2022-11-22 01:31:57,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494789759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:31:57,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:31:57,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:31:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130582258] [2022-11-22 01:31:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:31:57,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:31:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:31:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:31:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:57,710 INFO L87 Difference]: Start difference. First operand 275 states and 341 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:31:58,112 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2022-11-22 01:31:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:31:58,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-22 01:31:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:31:58,114 INFO L225 Difference]: With dead ends: 287 [2022-11-22 01:31:58,115 INFO L226 Difference]: Without dead ends: 282 [2022-11-22 01:31:58,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:31:58,115 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 25 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:31:58,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 482 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:31:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-22 01:31:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-11-22 01:31:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 208 states have (on average 1.3125) internal successors, (273), 272 states have internal predecessors, (273), 65 states have call successors, (65), 2 states have call predecessors, (65), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2022-11-22 01:31:58,184 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 95 [2022-11-22 01:31:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:31:58,184 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2022-11-22 01:31:58,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:31:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2022-11-22 01:31:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-22 01:31:58,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:31:58,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:31:58,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-22 01:31:58,185 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:31:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:31:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 275939282, now seen corresponding path program 1 times [2022-11-22 01:31:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:31:58,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146401994] [2022-11-22 01:31:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:31:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:31:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:32:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:32:49,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:32:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146401994] [2022-11-22 01:32:49,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146401994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:32:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097594200] [2022-11-22 01:32:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:32:49,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:32:49,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:32:49,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:32:49,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:32:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:32:50,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 01:32:50,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:35:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:35:25,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:38:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:38:01,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097594200] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:01,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:38:01,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 4] total 9 [2022-11-22 01:38:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912658528] [2022-11-22 01:38:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:38:01,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:38:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:38:01,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:38:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:38:01,225 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:38:01,319 INFO L93 Difference]: Finished difference Result 277 states and 339 transitions. [2022-11-22 01:38:01,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:38:01,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-11-22 01:38:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:38:01,321 INFO L225 Difference]: With dead ends: 277 [2022-11-22 01:38:01,322 INFO L226 Difference]: Without dead ends: 274 [2022-11-22 01:38:01,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:38:01,322 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:38:01,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 227 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:38:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-22 01:38:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-22 01:38:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 208 states have (on average 1.3076923076923077) internal successors, (272), 271 states have internal predecessors, (272), 64 states have call successors, (64), 2 states have call predecessors, (64), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2022-11-22 01:38:01,389 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 111 [2022-11-22 01:38:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:38:01,390 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2022-11-22 01:38:01,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:38:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2022-11-22 01:38:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-22 01:38:01,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:38:01,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:38:01,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:38:01,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-22 01:38:01,593 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:38:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:38:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1132823590, now seen corresponding path program 1 times [2022-11-22 01:38:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:38:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279039437] [2022-11-22 01:38:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:38:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:38:07,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:38:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279039437] [2022-11-22 01:38:07,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279039437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:38:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39467594] [2022-11-22 01:38:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:38:07,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:38:07,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:38:07,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:38:07,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1522c9-1eb5-4f2b-b5ea-d19dd26267b9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:38:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:38:08,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-22 01:38:08,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:40:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:40:17,196 INFO L328 TraceCheckSpWp]: Computing backward predicates...