./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 15:52:43,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:52:43,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:52:43,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:52:43,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:52:43,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:52:43,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:52:43,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:52:43,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:52:43,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:52:43,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:52:43,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:52:43,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:52:43,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:52:43,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:52:43,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:52:43,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:52:43,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:52:43,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:52:43,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:52:43,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:52:43,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:52:43,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:52:43,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:52:43,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:52:43,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:52:43,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:52:43,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:52:43,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:52:43,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:52:43,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:52:43,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:52:43,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:52:43,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:52:43,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:52:43,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:52:43,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:52:43,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:52:43,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:52:43,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:52:43,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:52:43,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 15:52:43,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:52:43,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:52:43,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:52:43,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:52:43,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:52:43,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:52:43,587 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:52:43,587 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:52:43,587 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:52:43,588 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:52:43,589 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:52:43,589 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:52:43,589 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:52:43,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:52:43,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:52:43,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:52:43,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:52:43,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:52:43,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:52:43,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:52:43,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:52:43,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:52:43,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:52:43,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:52:43,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:52:43,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:52:43,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:52:43,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:52:43,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:52:43,593 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:52:43,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:52:43,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:52:43,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:52:43,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:52:43,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:52:43,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:52:43,594 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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh 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-12-14 15:52:43,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:52:43,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:52:43,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:52:43,803 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:52:43,803 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:52:43,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/eca-rers2018/Problem10.c [2022-12-14 15:52:46,373 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:52:46,594 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:52:46,594 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/sv-benchmarks/c/eca-rers2018/Problem10.c [2022-12-14 15:52:46,605 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/data/e8cab6469/82cb3b70c8a34d42a6534b1d3d4c23e9/FLAG61e5aaaaa [2022-12-14 15:52:46,616 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/data/e8cab6469/82cb3b70c8a34d42a6534b1d3d4c23e9 [2022-12-14 15:52:46,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:52:46,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:52:46,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:52:46,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:52:46,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:52:46,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:52:46" (1/1) ... [2022-12-14 15:52:46,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dfe864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:46, skipping insertion in model container [2022-12-14 15:52:46,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:52:46" (1/1) ... [2022-12-14 15:52:46,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:52:46,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:52:46,798 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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-12-14 15:52:46,803 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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-12-14 15:52:47,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:52:47,213 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:52:47,224 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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2022-12-14 15:52:47,224 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_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2022-12-14 15:52:47,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:52:47,345 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:52:47,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47 WrapperNode [2022-12-14 15:52:47,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:52:47,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:52:47,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:52:47,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:52:47,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,418 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 865 [2022-12-14 15:52:47,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:52:47,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:52:47,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:52:47,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:52:47,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,474 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:52:47,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:52:47,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:52:47,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:52:47,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (1/1) ... [2022-12-14 15:52:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:52:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:52:47,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:52:47,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:52:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:52:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2022-12-14 15:52:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2022-12-14 15:52:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2022-12-14 15:52:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2022-12-14 15:52:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:52:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:52:47,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:52:47,642 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:52:47,643 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:52:48,419 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:52:49,578 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:52:49,578 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:52:49,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:52:49 BoogieIcfgContainer [2022-12-14 15:52:49,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:52:49,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:52:49,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:52:49,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:52:49,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:52:46" (1/3) ... [2022-12-14 15:52:49,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4720a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:52:49, skipping insertion in model container [2022-12-14 15:52:49,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:52:47" (2/3) ... [2022-12-14 15:52:49,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4720a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:52:49, skipping insertion in model container [2022-12-14 15:52:49,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:52:49" (3/3) ... [2022-12-14 15:52:49,587 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2022-12-14 15:52:49,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:52:49,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 15:52:49,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:52:49,664 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;@1acb098c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:52:49,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 15:52:49,669 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-12-14 15:52:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:52:49,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:49,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:52:49,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1927163450, now seen corresponding path program 1 times [2022-12-14 15:52:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:49,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145318217] [2022-12-14 15:52:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:50,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145318217] [2022-12-14 15:52:50,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145318217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:50,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:50,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842878324] [2022-12-14 15:52:50,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:50,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:50,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:50,596 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-12-14 15:52:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:51,082 INFO L93 Difference]: Finished difference Result 527 states and 926 transitions. [2022-12-14 15:52:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:51,085 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-12-14 15:52:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:51,092 INFO L225 Difference]: With dead ends: 527 [2022-12-14 15:52:51,092 INFO L226 Difference]: Without dead ends: 212 [2022-12-14 15:52:51,097 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-12-14 15:52:51,101 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 290 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:51,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 276 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:52:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-14 15:52:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2022-12-14 15:52:51,164 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-12-14 15:52:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2022-12-14 15:52:51,168 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 6 [2022-12-14 15:52:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:51,169 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2022-12-14 15:52:51,169 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-12-14 15:52:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2022-12-14 15:52:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:52:51,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:51,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:51,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:52:51,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:51,172 INFO L85 PathProgramCache]: Analyzing trace with hash -388192148, now seen corresponding path program 1 times [2022-12-14 15:52:51,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:51,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042162416] [2022-12-14 15:52:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:51,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:52,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:52,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042162416] [2022-12-14 15:52:52,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042162416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:52,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:52,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739878178] [2022-12-14 15:52:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:52,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:52,449 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-12-14 15:52:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:52,858 INFO L93 Difference]: Finished difference Result 210 states and 305 transitions. [2022-12-14 15:52:52,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:52,860 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-12-14 15:52:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:52,862 INFO L225 Difference]: With dead ends: 210 [2022-12-14 15:52:52,862 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 15:52:52,863 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-12-14 15:52:52,864 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 295 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:52,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 292 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:52:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 15:52:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-12-14 15:52:52,884 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-12-14 15:52:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2022-12-14 15:52:52,886 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 7 [2022-12-14 15:52:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:52,886 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2022-12-14 15:52:52,886 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-12-14 15:52:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2022-12-14 15:52:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:52:52,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:52,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:52,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:52:52,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 850235135, now seen corresponding path program 1 times [2022-12-14 15:52:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:52,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646401578] [2022-12-14 15:52:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:54,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-12-14 15:52:54,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:54,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646401578] [2022-12-14 15:52:54,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646401578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:54,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:54,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961699383] [2022-12-14 15:52:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:54,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:54,370 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-12-14 15:52:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:54,953 INFO L93 Difference]: Finished difference Result 338 states and 525 transitions. [2022-12-14 15:52:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:54,953 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-12-14 15:52:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:54,956 INFO L225 Difference]: With dead ends: 338 [2022-12-14 15:52:54,956 INFO L226 Difference]: Without dead ends: 335 [2022-12-14 15:52:54,956 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-12-14 15:52:54,957 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 292 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:54,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 129 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:52:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-14 15:52:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 209. [2022-12-14 15:52:54,971 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-12-14 15:52:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 303 transitions. [2022-12-14 15:52:54,971 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 303 transitions. Word has length 8 [2022-12-14 15:52:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:54,972 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 303 transitions. [2022-12-14 15:52:54,972 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-12-14 15:52:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 303 transitions. [2022-12-14 15:52:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:52:54,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:54,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:54,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:52:54,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash 586782033, now seen corresponding path program 1 times [2022-12-14 15:52:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511257566] [2022-12-14 15:52:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:55,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:55,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511257566] [2022-12-14 15:52:55,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511257566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:55,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:55,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620580720] [2022-12-14 15:52:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:55,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:55,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:55,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:55,334 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-12-14 15:52:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:55,662 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-12-14 15:52:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:55,663 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-12-14 15:52:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:55,664 INFO L225 Difference]: With dead ends: 215 [2022-12-14 15:52:55,664 INFO L226 Difference]: Without dead ends: 211 [2022-12-14 15:52:55,665 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-12-14 15:52:55,666 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 291 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:55,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 268 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:52:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-14 15:52:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-12-14 15:52:55,676 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-12-14 15:52:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-12-14 15:52:55,677 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 9 [2022-12-14 15:52:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:55,677 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-12-14 15:52:55,678 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-12-14 15:52:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-12-14 15:52:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:52:55,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:55,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:55,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:52:55,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1009677255, now seen corresponding path program 1 times [2022-12-14 15:52:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:55,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962435844] [2022-12-14 15:52:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:56,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962435844] [2022-12-14 15:52:56,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962435844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:56,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:56,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526764713] [2022-12-14 15:52:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:56,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:56,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:56,633 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-12-14 15:52:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:56,963 INFO L93 Difference]: Finished difference Result 403 states and 585 transitions. [2022-12-14 15:52:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:56,963 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-12-14 15:52:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:56,965 INFO L225 Difference]: With dead ends: 403 [2022-12-14 15:52:56,965 INFO L226 Difference]: Without dead ends: 400 [2022-12-14 15:52:56,966 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-12-14 15:52:56,966 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:56,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 569 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:52:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-12-14 15:52:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 209. [2022-12-14 15:52:56,988 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-12-14 15:52:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions. [2022-12-14 15:52:56,989 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 10 [2022-12-14 15:52:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:56,989 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 301 transitions. [2022-12-14 15:52:56,990 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-12-14 15:52:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions. [2022-12-14 15:52:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:52:56,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:56,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:56,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:52:56,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1234533942, now seen corresponding path program 1 times [2022-12-14 15:52:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:56,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504523523] [2022-12-14 15:52:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:57,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:57,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504523523] [2022-12-14 15:52:57,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504523523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:57,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:57,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:57,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699421519] [2022-12-14 15:52:57,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:57,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:57,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:57,639 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-12-14 15:52:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:58,129 INFO L93 Difference]: Finished difference Result 381 states and 561 transitions. [2022-12-14 15:52:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:58,129 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-12-14 15:52:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:58,132 INFO L225 Difference]: With dead ends: 381 [2022-12-14 15:52:58,132 INFO L226 Difference]: Without dead ends: 378 [2022-12-14 15:52:58,132 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-12-14 15:52:58,133 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 284 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:58,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 175 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:52:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-12-14 15:52:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 210. [2022-12-14 15:52:58,147 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-12-14 15:52:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 302 transitions. [2022-12-14 15:52:58,148 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 302 transitions. Word has length 11 [2022-12-14 15:52:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:58,148 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 302 transitions. [2022-12-14 15:52:58,148 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-12-14 15:52:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 302 transitions. [2022-12-14 15:52:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:52:58,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:58,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:52:58,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash -384836468, now seen corresponding path program 1 times [2022-12-14 15:52:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:58,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773614468] [2022-12-14 15:52:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:59,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:59,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773614468] [2022-12-14 15:52:59,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773614468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:59,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:59,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:59,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348403161] [2022-12-14 15:52:59,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:59,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:59,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:59,154 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-12-14 15:52:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:52:59,505 INFO L93 Difference]: Finished difference Result 403 states and 582 transitions. [2022-12-14 15:52:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:52:59,506 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-12-14 15:52:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:52:59,508 INFO L225 Difference]: With dead ends: 403 [2022-12-14 15:52:59,508 INFO L226 Difference]: Without dead ends: 397 [2022-12-14 15:52:59,508 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-12-14 15:52:59,509 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 276 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:52:59,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 564 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:52:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-14 15:52:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 282. [2022-12-14 15:52:59,534 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-12-14 15:52:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 442 transitions. [2022-12-14 15:52:59,535 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 442 transitions. Word has length 12 [2022-12-14 15:52:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:52:59,535 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 442 transitions. [2022-12-14 15:52:59,535 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-12-14 15:52:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 442 transitions. [2022-12-14 15:52:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:52:59,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:52:59,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:52:59,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:52:59,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:52:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:52:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash 954295067, now seen corresponding path program 1 times [2022-12-14 15:52:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:52:59,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929644689] [2022-12-14 15:52:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:52:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:52:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:52:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:52:59,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:52:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929644689] [2022-12-14 15:52:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929644689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:52:59,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:52:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:52:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24611516] [2022-12-14 15:52:59,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:52:59,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:52:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:52:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:52:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:52:59,912 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-12-14 15:53:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:00,232 INFO L93 Difference]: Finished difference Result 404 states and 580 transitions. [2022-12-14 15:53:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:00,232 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-12-14 15:53:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:00,234 INFO L225 Difference]: With dead ends: 404 [2022-12-14 15:53:00,234 INFO L226 Difference]: Without dead ends: 392 [2022-12-14 15:53:00,234 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-12-14 15:53:00,234 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 253 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:00,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 558 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-12-14 15:53:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 292. [2022-12-14 15:53:00,253 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-12-14 15:53:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 451 transitions. [2022-12-14 15:53:00,254 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 451 transitions. Word has length 13 [2022-12-14 15:53:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:00,254 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 451 transitions. [2022-12-14 15:53:00,254 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-12-14 15:53:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 451 transitions. [2022-12-14 15:53:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:53:00,254 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:00,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:53:00,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2066856960, now seen corresponding path program 1 times [2022-12-14 15:53:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308241200] [2022-12-14 15:53:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:01,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:01,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308241200] [2022-12-14 15:53:01,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308241200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:01,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:01,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858889930] [2022-12-14 15:53:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:01,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:01,836 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-12-14 15:53:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:02,230 INFO L93 Difference]: Finished difference Result 325 states and 492 transitions. [2022-12-14 15:53:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:02,230 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-12-14 15:53:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:02,232 INFO L225 Difference]: With dead ends: 325 [2022-12-14 15:53:02,232 INFO L226 Difference]: Without dead ends: 322 [2022-12-14 15:53:02,232 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-12-14 15:53:02,233 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 264 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:02,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 130 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-12-14 15:53:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2022-12-14 15:53:02,265 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-12-14 15:53:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 450 transitions. [2022-12-14 15:53:02,266 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 450 transitions. Word has length 15 [2022-12-14 15:53:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 450 transitions. [2022-12-14 15:53:02,267 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-12-14 15:53:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 450 transitions. [2022-12-14 15:53:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:53:02,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:02,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:02,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:53:02,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 351287827, now seen corresponding path program 1 times [2022-12-14 15:53:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:02,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101873274] [2022-12-14 15:53:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:02,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-12-14 15:53:02,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:02,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101873274] [2022-12-14 15:53:02,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101873274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:02,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:02,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839579752] [2022-12-14 15:53:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:02,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:02,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:02,647 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-12-14 15:53:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:02,912 INFO L93 Difference]: Finished difference Result 298 states and 453 transitions. [2022-12-14 15:53:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:02,913 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-12-14 15:53:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:02,913 INFO L225 Difference]: With dead ends: 298 [2022-12-14 15:53:02,913 INFO L226 Difference]: Without dead ends: 294 [2022-12-14 15:53:02,914 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-12-14 15:53:02,914 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 265 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:02,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 286 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-12-14 15:53:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2022-12-14 15:53:02,931 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-12-14 15:53:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2022-12-14 15:53:02,932 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 16 [2022-12-14 15:53:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:02,932 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2022-12-14 15:53:02,933 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-12-14 15:53:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2022-12-14 15:53:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:53:02,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:02,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:02,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:53:02,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1995628315, now seen corresponding path program 1 times [2022-12-14 15:53:02,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:02,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953989742] [2022-12-14 15:53:02,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953989742] [2022-12-14 15:53:03,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953989742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294467835] [2022-12-14 15:53:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,115 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-12-14 15:53:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,170 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2022-12-14 15:53:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:03,170 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-12-14 15:53:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,171 INFO L225 Difference]: With dead ends: 292 [2022-12-14 15:53:03,171 INFO L226 Difference]: Without dead ends: 288 [2022-12-14 15:53:03,171 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-12-14 15:53:03,172 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,172 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.0s Time] [2022-12-14 15:53:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-14 15:53:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-12-14 15:53:03,189 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-12-14 15:53:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 438 transitions. [2022-12-14 15:53:03,190 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 438 transitions. Word has length 17 [2022-12-14 15:53:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,190 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 438 transitions. [2022-12-14 15:53:03,190 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-12-14 15:53:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 438 transitions. [2022-12-14 15:53:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:53:03,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:53:03,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1735577896, now seen corresponding path program 1 times [2022-12-14 15:53:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242264431] [2022-12-14 15:53:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242264431] [2022-12-14 15:53:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242264431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136692826] [2022-12-14 15:53:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:03,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:03,673 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-12-14 15:53:03,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,912 INFO L93 Difference]: Finished difference Result 290 states and 439 transitions. [2022-12-14 15:53:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:03,913 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-12-14 15:53:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,915 INFO L225 Difference]: With dead ends: 290 [2022-12-14 15:53:03,915 INFO L226 Difference]: Without dead ends: 287 [2022-12-14 15:53:03,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-12-14 15:53:03,916 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 270 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 275 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-14 15:53:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-12-14 15:53:03,935 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-12-14 15:53:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 435 transitions. [2022-12-14 15:53:03,936 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 435 transitions. Word has length 18 [2022-12-14 15:53:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,936 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 435 transitions. [2022-12-14 15:53:03,936 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-12-14 15:53:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 435 transitions. [2022-12-14 15:53:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:53:03,937 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,937 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-12-14 15:53:03,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:53:03,937 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2031024586, now seen corresponding path program 1 times [2022-12-14 15:53:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164623936] [2022-12-14 15:53:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:04,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:04,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164623936] [2022-12-14 15:53:04,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164623936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:04,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:04,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:04,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834846506] [2022-12-14 15:53:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:04,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:04,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:04,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:04,356 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-12-14 15:53:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:04,683 INFO L93 Difference]: Finished difference Result 289 states and 436 transitions. [2022-12-14 15:53:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:04,683 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-12-14 15:53:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:04,685 INFO L225 Difference]: With dead ends: 289 [2022-12-14 15:53:04,685 INFO L226 Difference]: Without dead ends: 286 [2022-12-14 15:53:04,685 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-12-14 15:53:04,686 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 267 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:04,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 274 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-12-14 15:53:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-12-14 15:53:04,705 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-12-14 15:53:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 432 transitions. [2022-12-14 15:53:04,706 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 432 transitions. Word has length 19 [2022-12-14 15:53:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:04,706 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 432 transitions. [2022-12-14 15:53:04,707 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-12-14 15:53:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 432 transitions. [2022-12-14 15:53:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:53:04,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:04,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] [2022-12-14 15:53:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 15:53:04,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1463375971, now seen corresponding path program 1 times [2022-12-14 15:53:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128166282] [2022-12-14 15:53:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:05,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128166282] [2022-12-14 15:53:05,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128166282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:05,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:05,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540055548] [2022-12-14 15:53:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:05,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:05,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:05,301 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-12-14 15:53:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:05,565 INFO L93 Difference]: Finished difference Result 288 states and 433 transitions. [2022-12-14 15:53:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:05,566 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-12-14 15:53:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:05,566 INFO L225 Difference]: With dead ends: 288 [2022-12-14 15:53:05,566 INFO L226 Difference]: Without dead ends: 285 [2022-12-14 15:53:05,567 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-12-14 15:53:05,567 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 264 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:05,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 275 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-14 15:53:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-12-14 15:53:05,586 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-12-14 15:53:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2022-12-14 15:53:05,587 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 20 [2022-12-14 15:53:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:05,587 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2022-12-14 15:53:05,587 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-12-14 15:53:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2022-12-14 15:53:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:53:05,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:05,587 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-12-14 15:53:05,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:53:05,587 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:05,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:05,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1879363247, now seen corresponding path program 1 times [2022-12-14 15:53:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:05,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297736468] [2022-12-14 15:53:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:06,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:06,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297736468] [2022-12-14 15:53:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297736468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:06,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:06,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104401576] [2022-12-14 15:53:06,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:06,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:06,856 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-12-14 15:53:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:07,219 INFO L93 Difference]: Finished difference Result 312 states and 463 transitions. [2022-12-14 15:53:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:07,219 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-12-14 15:53:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:07,220 INFO L225 Difference]: With dead ends: 312 [2022-12-14 15:53:07,220 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 15:53:07,220 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-12-14 15:53:07,221 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 244 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:07,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 117 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 15:53:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 285. [2022-12-14 15:53:07,244 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-12-14 15:53:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2022-12-14 15:53:07,244 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 21 [2022-12-14 15:53:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:07,245 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2022-12-14 15:53:07,245 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-12-14 15:53:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2022-12-14 15:53:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:53:07,245 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:07,245 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-12-14 15:53:07,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:53:07,245 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1869896606, now seen corresponding path program 1 times [2022-12-14 15:53:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:07,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293439377] [2022-12-14 15:53:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:08,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293439377] [2022-12-14 15:53:08,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293439377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:08,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:08,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230860161] [2022-12-14 15:53:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:08,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:08,982 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-12-14 15:53:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:09,516 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2022-12-14 15:53:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:53:09,517 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-12-14 15:53:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:09,519 INFO L225 Difference]: With dead ends: 360 [2022-12-14 15:53:09,519 INFO L226 Difference]: Without dead ends: 355 [2022-12-14 15:53:09,519 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-12-14 15:53:09,520 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 391 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:09,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 267 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:53:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-12-14 15:53:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 285. [2022-12-14 15:53:09,563 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-12-14 15:53:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2022-12-14 15:53:09,565 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 22 [2022-12-14 15:53:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:09,565 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2022-12-14 15:53:09,565 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-12-14 15:53:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2022-12-14 15:53:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:53:09,566 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:09,566 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-12-14 15:53:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 15:53:09,566 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2132828268, now seen corresponding path program 1 times [2022-12-14 15:53:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:09,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741179367] [2022-12-14 15:53:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:10,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741179367] [2022-12-14 15:53:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741179367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:10,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:10,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551961182] [2022-12-14 15:53:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:10,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:10,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:10,128 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-12-14 15:53:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:10,454 INFO L93 Difference]: Finished difference Result 291 states and 427 transitions. [2022-12-14 15:53:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:10,455 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-12-14 15:53:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:10,456 INFO L225 Difference]: With dead ends: 291 [2022-12-14 15:53:10,456 INFO L226 Difference]: Without dead ends: 288 [2022-12-14 15:53:10,457 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-12-14 15:53:10,457 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 246 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:10,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-14 15:53:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-12-14 15:53:10,482 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-12-14 15:53:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 421 transitions. [2022-12-14 15:53:10,483 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 421 transitions. Word has length 23 [2022-12-14 15:53:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:10,483 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 421 transitions. [2022-12-14 15:53:10,483 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-12-14 15:53:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 421 transitions. [2022-12-14 15:53:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:53:10,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:10,484 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-12-14 15:53:10,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 15:53:10,484 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1693768406, now seen corresponding path program 1 times [2022-12-14 15:53:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:10,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955754719] [2022-12-14 15:53:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:12,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955754719] [2022-12-14 15:53:12,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955754719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:12,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:12,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824954412] [2022-12-14 15:53:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:12,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:12,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:12,563 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-12-14 15:53:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:13,089 INFO L93 Difference]: Finished difference Result 320 states and 466 transitions. [2022-12-14 15:53:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:13,089 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-12-14 15:53:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:13,091 INFO L225 Difference]: With dead ends: 320 [2022-12-14 15:53:13,091 INFO L226 Difference]: Without dead ends: 317 [2022-12-14 15:53:13,091 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-12-14 15:53:13,092 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 230 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:13,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 143 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:53:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-14 15:53:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2022-12-14 15:53:13,119 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-12-14 15:53:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 420 transitions. [2022-12-14 15:53:13,119 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 420 transitions. Word has length 24 [2022-12-14 15:53:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:13,119 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 420 transitions. [2022-12-14 15:53:13,120 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-12-14 15:53:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 420 transitions. [2022-12-14 15:53:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:53:13,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:13,120 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-12-14 15:53:13,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 15:53:13,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash -967807879, now seen corresponding path program 1 times [2022-12-14 15:53:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003230090] [2022-12-14 15:53:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:13,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:13,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003230090] [2022-12-14 15:53:13,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003230090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:13,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:13,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930305778] [2022-12-14 15:53:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:13,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:13,793 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-12-14 15:53:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:14,076 INFO L93 Difference]: Finished difference Result 286 states and 421 transitions. [2022-12-14 15:53:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:14,076 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-12-14 15:53:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:14,078 INFO L225 Difference]: With dead ends: 286 [2022-12-14 15:53:14,078 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 15:53:14,078 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-12-14 15:53:14,079 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 255 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:14,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 270 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 15:53:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-12-14 15:53:14,106 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-12-14 15:53:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2022-12-14 15:53:14,107 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 25 [2022-12-14 15:53:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:14,107 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2022-12-14 15:53:14,107 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-12-14 15:53:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2022-12-14 15:53:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:53:14,107 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:14,107 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-12-14 15:53:14,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 15:53:14,108 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 62138860, now seen corresponding path program 1 times [2022-12-14 15:53:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866044752] [2022-12-14 15:53:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:16,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866044752] [2022-12-14 15:53:16,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866044752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:16,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:16,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183558227] [2022-12-14 15:53:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:16,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:16,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:16,498 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-12-14 15:53:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:16,826 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions. [2022-12-14 15:53:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:16,826 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-12-14 15:53:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:16,827 INFO L225 Difference]: With dead ends: 285 [2022-12-14 15:53:16,827 INFO L226 Difference]: Without dead ends: 280 [2022-12-14 15:53:16,827 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-12-14 15:53:16,827 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 248 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:16,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 88 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-12-14 15:53:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-12-14 15:53:16,854 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-12-14 15:53:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2022-12-14 15:53:16,855 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 409 transitions. Word has length 26 [2022-12-14 15:53:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:16,855 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 409 transitions. [2022-12-14 15:53:16,855 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-12-14 15:53:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2022-12-14 15:53:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:53:16,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:16,855 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-12-14 15:53:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:53:16,856 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1925723486, now seen corresponding path program 1 times [2022-12-14 15:53:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507942996] [2022-12-14 15:53:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:18,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:18,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507942996] [2022-12-14 15:53:18,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507942996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:18,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:18,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275010645] [2022-12-14 15:53:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:18,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:18,284 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-12-14 15:53:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:18,751 INFO L93 Difference]: Finished difference Result 341 states and 479 transitions. [2022-12-14 15:53:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:18,751 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-12-14 15:53:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:18,752 INFO L225 Difference]: With dead ends: 341 [2022-12-14 15:53:18,752 INFO L226 Difference]: Without dead ends: 338 [2022-12-14 15:53:18,752 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-12-14 15:53:18,753 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 213 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:18,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 164 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-12-14 15:53:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 280. [2022-12-14 15:53:18,782 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-12-14 15:53:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2022-12-14 15:53:18,783 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 27 [2022-12-14 15:53:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:18,783 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2022-12-14 15:53:18,783 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-12-14 15:53:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-12-14 15:53:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:53:18,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:18,784 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-12-14 15:53:18,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 15:53:18,784 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -432688463, now seen corresponding path program 1 times [2022-12-14 15:53:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143184414] [2022-12-14 15:53:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:20,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:20,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143184414] [2022-12-14 15:53:20,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143184414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:20,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:20,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706271824] [2022-12-14 15:53:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:20,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:20,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:20,333 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-12-14 15:53:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:20,737 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2022-12-14 15:53:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:20,738 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-12-14 15:53:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:20,740 INFO L225 Difference]: With dead ends: 307 [2022-12-14 15:53:20,740 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 15:53:20,740 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-12-14 15:53:20,741 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 218 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:20,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 124 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 15:53:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2022-12-14 15:53:20,793 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-12-14 15:53:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 407 transitions. [2022-12-14 15:53:20,794 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 407 transitions. Word has length 28 [2022-12-14 15:53:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:20,794 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 407 transitions. [2022-12-14 15:53:20,794 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-12-14 15:53:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-12-14 15:53:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 15:53:20,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:20,795 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-12-14 15:53:20,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 15:53:20,795 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash -529008058, now seen corresponding path program 1 times [2022-12-14 15:53:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:20,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651597598] [2022-12-14 15:53:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:23,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651597598] [2022-12-14 15:53:23,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651597598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:23,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:23,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:23,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397754204] [2022-12-14 15:53:23,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:23,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:23,549 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-12-14 15:53:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:23,984 INFO L93 Difference]: Finished difference Result 318 states and 454 transitions. [2022-12-14 15:53:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:23,985 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-12-14 15:53:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:23,987 INFO L225 Difference]: With dead ends: 318 [2022-12-14 15:53:23,987 INFO L226 Difference]: Without dead ends: 315 [2022-12-14 15:53:23,987 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-12-14 15:53:23,987 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 214 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 138 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-12-14 15:53:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2022-12-14 15:53:24,022 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-12-14 15:53:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 406 transitions. [2022-12-14 15:53:24,022 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 406 transitions. Word has length 29 [2022-12-14 15:53:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:24,023 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 406 transitions. [2022-12-14 15:53:24,023 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-12-14 15:53:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 406 transitions. [2022-12-14 15:53:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:53:24,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:24,023 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-12-14 15:53:24,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 15:53:24,023 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 780058486, now seen corresponding path program 1 times [2022-12-14 15:53:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927922566] [2022-12-14 15:53:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:25,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927922566] [2022-12-14 15:53:25,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927922566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:25,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:25,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:25,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523985815] [2022-12-14 15:53:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:25,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:25,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:25,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:25,304 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-12-14 15:53:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:25,662 INFO L93 Difference]: Finished difference Result 350 states and 485 transitions. [2022-12-14 15:53:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:25,663 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-12-14 15:53:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:25,663 INFO L225 Difference]: With dead ends: 350 [2022-12-14 15:53:25,663 INFO L226 Difference]: Without dead ends: 347 [2022-12-14 15:53:25,663 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-12-14 15:53:25,664 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 197 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:25,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 481 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-12-14 15:53:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 280. [2022-12-14 15:53:25,698 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-12-14 15:53:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 405 transitions. [2022-12-14 15:53:25,699 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 405 transitions. Word has length 30 [2022-12-14 15:53:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:25,699 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 405 transitions. [2022-12-14 15:53:25,699 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-12-14 15:53:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 405 transitions. [2022-12-14 15:53:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:53:25,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:25,700 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-12-14 15:53:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 15:53:25,700 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1588544728, now seen corresponding path program 1 times [2022-12-14 15:53:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:25,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825289683] [2022-12-14 15:53:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:26,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:26,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825289683] [2022-12-14 15:53:26,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825289683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:26,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:26,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514638956] [2022-12-14 15:53:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:26,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:26,179 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-12-14 15:53:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:26,450 INFO L93 Difference]: Finished difference Result 282 states and 406 transitions. [2022-12-14 15:53:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:26,451 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-12-14 15:53:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:26,452 INFO L225 Difference]: With dead ends: 282 [2022-12-14 15:53:26,452 INFO L226 Difference]: Without dead ends: 279 [2022-12-14 15:53:26,452 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-12-14 15:53:26,452 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 241 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:26,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 263 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-14 15:53:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-12-14 15:53:26,499 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-12-14 15:53:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 402 transitions. [2022-12-14 15:53:26,500 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 402 transitions. Word has length 31 [2022-12-14 15:53:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:26,500 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 402 transitions. [2022-12-14 15:53:26,500 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-12-14 15:53:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 402 transitions. [2022-12-14 15:53:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:53:26,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:26,501 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-12-14 15:53:26,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 15:53:26,501 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1365468416, now seen corresponding path program 1 times [2022-12-14 15:53:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:26,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673772879] [2022-12-14 15:53:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:28,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:28,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673772879] [2022-12-14 15:53:28,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673772879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:28,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372926343] [2022-12-14 15:53:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:28,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:28,346 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-12-14 15:53:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:28,840 INFO L93 Difference]: Finished difference Result 306 states and 438 transitions. [2022-12-14 15:53:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:28,840 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-12-14 15:53:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:28,841 INFO L225 Difference]: With dead ends: 306 [2022-12-14 15:53:28,841 INFO L226 Difference]: Without dead ends: 303 [2022-12-14 15:53:28,841 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-12-14 15:53:28,841 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 205 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 135 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-12-14 15:53:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 279. [2022-12-14 15:53:28,877 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-12-14 15:53:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 401 transitions. [2022-12-14 15:53:28,878 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 401 transitions. Word has length 34 [2022-12-14 15:53:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:28,878 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 401 transitions. [2022-12-14 15:53:28,878 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-12-14 15:53:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 401 transitions. [2022-12-14 15:53:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:53:28,879 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:28,879 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-12-14 15:53:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 15:53:28,879 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -620678926, now seen corresponding path program 1 times [2022-12-14 15:53:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:28,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758201073] [2022-12-14 15:53:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:30,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:30,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758201073] [2022-12-14 15:53:30,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758201073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:30,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:30,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044670805] [2022-12-14 15:53:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:30,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:30,567 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-12-14 15:53:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:30,859 INFO L93 Difference]: Finished difference Result 281 states and 402 transitions. [2022-12-14 15:53:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:30,859 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-12-14 15:53:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:30,860 INFO L225 Difference]: With dead ends: 281 [2022-12-14 15:53:30,860 INFO L226 Difference]: Without dead ends: 278 [2022-12-14 15:53:30,860 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-12-14 15:53:30,860 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 246 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:30,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 252 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-14 15:53:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-12-14 15:53:30,904 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-12-14 15:53:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 398 transitions. [2022-12-14 15:53:30,904 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 398 transitions. Word has length 35 [2022-12-14 15:53:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:30,904 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 398 transitions. [2022-12-14 15:53:30,905 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-12-14 15:53:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 398 transitions. [2022-12-14 15:53:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 15:53:30,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:30,905 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-12-14 15:53:30,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 15:53:30,905 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash 511370714, now seen corresponding path program 1 times [2022-12-14 15:53:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:30,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067173178] [2022-12-14 15:53:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:32,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:32,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067173178] [2022-12-14 15:53:32,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067173178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:32,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255473685] [2022-12-14 15:53:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:32,607 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-12-14 15:53:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:33,033 INFO L93 Difference]: Finished difference Result 312 states and 440 transitions. [2022-12-14 15:53:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:33,034 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-12-14 15:53:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:33,035 INFO L225 Difference]: With dead ends: 312 [2022-12-14 15:53:33,035 INFO L226 Difference]: Without dead ends: 305 [2022-12-14 15:53:33,036 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-12-14 15:53:33,036 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 194 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:33,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 136 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-12-14 15:53:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-12-14 15:53:33,073 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-12-14 15:53:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 401 transitions. [2022-12-14 15:53:33,074 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 401 transitions. Word has length 37 [2022-12-14 15:53:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:33,074 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 401 transitions. [2022-12-14 15:53:33,074 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-12-14 15:53:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 401 transitions. [2022-12-14 15:53:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 15:53:33,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:33,074 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-12-14 15:53:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 15:53:33,075 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1327883638, now seen corresponding path program 1 times [2022-12-14 15:53:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:33,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735188916] [2022-12-14 15:53:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:35,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:35,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735188916] [2022-12-14 15:53:35,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735188916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:35,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:35,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033501517] [2022-12-14 15:53:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:35,229 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-12-14 15:53:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:35,653 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2022-12-14 15:53:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:35,653 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-12-14 15:53:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:35,654 INFO L225 Difference]: With dead ends: 308 [2022-12-14 15:53:35,654 INFO L226 Difference]: Without dead ends: 305 [2022-12-14 15:53:35,654 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-12-14 15:53:35,654 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 189 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:35,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 153 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-12-14 15:53:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2022-12-14 15:53:35,693 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-12-14 15:53:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 400 transitions. [2022-12-14 15:53:35,694 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 400 transitions. Word has length 38 [2022-12-14 15:53:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:35,694 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 400 transitions. [2022-12-14 15:53:35,694 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-12-14 15:53:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 400 transitions. [2022-12-14 15:53:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 15:53:35,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:35,694 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-12-14 15:53:35,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 15:53:35,695 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1784780476, now seen corresponding path program 1 times [2022-12-14 15:53:35,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:35,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785139420] [2022-12-14 15:53:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:35,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:37,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:37,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785139420] [2022-12-14 15:53:37,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785139420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:37,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:37,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791727270] [2022-12-14 15:53:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:37,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:37,523 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-12-14 15:53:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:37,918 INFO L93 Difference]: Finished difference Result 283 states and 401 transitions. [2022-12-14 15:53:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:37,918 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-12-14 15:53:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:37,920 INFO L225 Difference]: With dead ends: 283 [2022-12-14 15:53:37,920 INFO L226 Difference]: Without dead ends: 280 [2022-12-14 15:53:37,920 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-12-14 15:53:37,920 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 238 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:37,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 85 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-12-14 15:53:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-12-14 15:53:37,958 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-12-14 15:53:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 397 transitions. [2022-12-14 15:53:37,959 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 397 transitions. Word has length 39 [2022-12-14 15:53:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:37,959 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 397 transitions. [2022-12-14 15:53:37,959 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-12-14 15:53:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 397 transitions. [2022-12-14 15:53:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 15:53:37,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:37,959 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-12-14 15:53:37,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 15:53:37,960 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -506873009, now seen corresponding path program 1 times [2022-12-14 15:53:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:37,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757082515] [2022-12-14 15:53:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:38,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-12-14 15:53:38,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757082515] [2022-12-14 15:53:38,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757082515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:38,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:38,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286386742] [2022-12-14 15:53:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:38,037 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-12-14 15:53:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:38,123 INFO L93 Difference]: Finished difference Result 282 states and 398 transitions. [2022-12-14 15:53:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:38,124 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-12-14 15:53:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:38,124 INFO L225 Difference]: With dead ends: 282 [2022-12-14 15:53:38,124 INFO L226 Difference]: Without dead ends: 278 [2022-12-14 15:53:38,124 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-12-14 15:53:38,125 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:38,125 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.0s Time] [2022-12-14 15:53:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-14 15:53:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-12-14 15:53:38,163 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-12-14 15:53:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 392 transitions. [2022-12-14 15:53:38,163 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 392 transitions. Word has length 40 [2022-12-14 15:53:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:38,163 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 392 transitions. [2022-12-14 15:53:38,163 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-12-14 15:53:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 392 transitions. [2022-12-14 15:53:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:53:38,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:38,164 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-12-14 15:53:38,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 15:53:38,164 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1466319777, now seen corresponding path program 1 times [2022-12-14 15:53:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393518452] [2022-12-14 15:53:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:39,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-12-14 15:53:39,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:39,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393518452] [2022-12-14 15:53:39,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393518452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:39,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:39,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11816661] [2022-12-14 15:53:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:39,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:39,392 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-12-14 15:53:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:39,899 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2022-12-14 15:53:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:39,900 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-12-14 15:53:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:39,901 INFO L225 Difference]: With dead ends: 306 [2022-12-14 15:53:39,902 INFO L226 Difference]: Without dead ends: 298 [2022-12-14 15:53:39,902 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-12-14 15:53:39,902 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 181 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:39,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 132 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-14 15:53:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 281. [2022-12-14 15:53:39,941 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-12-14 15:53:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2022-12-14 15:53:39,942 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 41 [2022-12-14 15:53:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:39,942 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2022-12-14 15:53:39,942 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-12-14 15:53:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2022-12-14 15:53:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:53:39,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:39,943 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-12-14 15:53:39,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 15:53:39,943 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 368700550, now seen corresponding path program 1 times [2022-12-14 15:53:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:39,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809589166] [2022-12-14 15:53:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:41,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809589166] [2022-12-14 15:53:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809589166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:41,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:41,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506784735] [2022-12-14 15:53:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:41,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:41,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:41,981 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-12-14 15:53:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:42,446 INFO L93 Difference]: Finished difference Result 321 states and 433 transitions. [2022-12-14 15:53:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:42,447 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-12-14 15:53:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:42,449 INFO L225 Difference]: With dead ends: 321 [2022-12-14 15:53:42,449 INFO L226 Difference]: Without dead ends: 318 [2022-12-14 15:53:42,449 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-12-14 15:53:42,449 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 302 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:42,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 171 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-12-14 15:53:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2022-12-14 15:53:42,496 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-12-14 15:53:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 390 transitions. [2022-12-14 15:53:42,497 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 390 transitions. Word has length 43 [2022-12-14 15:53:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:42,497 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 390 transitions. [2022-12-14 15:53:42,497 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-12-14 15:53:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 390 transitions. [2022-12-14 15:53:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 15:53:42,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:42,497 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-12-14 15:53:42,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 15:53:42,497 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1455650596, now seen corresponding path program 1 times [2022-12-14 15:53:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:42,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227007859] [2022-12-14 15:53:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:44,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227007859] [2022-12-14 15:53:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227007859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:44,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51094268] [2022-12-14 15:53:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:44,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:44,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:44,193 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-12-14 15:53:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:44,444 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-12-14 15:53:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:44,445 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-12-14 15:53:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:44,446 INFO L225 Difference]: With dead ends: 330 [2022-12-14 15:53:44,446 INFO L226 Difference]: Without dead ends: 327 [2022-12-14 15:53:44,446 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-12-14 15:53:44,446 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:44,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 442 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-14 15:53:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 281. [2022-12-14 15:53:44,488 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-12-14 15:53:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 389 transitions. [2022-12-14 15:53:44,488 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 389 transitions. Word has length 44 [2022-12-14 15:53:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:44,489 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 389 transitions. [2022-12-14 15:53:44,489 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-12-14 15:53:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 389 transitions. [2022-12-14 15:53:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 15:53:44,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:44,489 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-12-14 15:53:44,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 15:53:44,489 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1264432542, now seen corresponding path program 1 times [2022-12-14 15:53:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:44,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707403421] [2022-12-14 15:53:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:46,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707403421] [2022-12-14 15:53:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707403421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:46,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801521609] [2022-12-14 15:53:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:46,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:46,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:46,017 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-12-14 15:53:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:46,396 INFO L93 Difference]: Finished difference Result 310 states and 420 transitions. [2022-12-14 15:53:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:46,396 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-12-14 15:53:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:46,397 INFO L225 Difference]: With dead ends: 310 [2022-12-14 15:53:46,397 INFO L226 Difference]: Without dead ends: 294 [2022-12-14 15:53:46,397 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-12-14 15:53:46,397 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 151 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:46,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 153 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-12-14 15:53:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2022-12-14 15:53:46,456 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-12-14 15:53:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 389 transitions. [2022-12-14 15:53:46,456 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 389 transitions. Word has length 46 [2022-12-14 15:53:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:46,456 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 389 transitions. [2022-12-14 15:53:46,456 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-12-14 15:53:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 389 transitions. [2022-12-14 15:53:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 15:53:46,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:46,457 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-12-14 15:53:46,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 15:53:46,457 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash -370317725, now seen corresponding path program 1 times [2022-12-14 15:53:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:46,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488697604] [2022-12-14 15:53:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:47,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:47,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488697604] [2022-12-14 15:53:47,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488697604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:47,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:47,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231547137] [2022-12-14 15:53:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:47,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:47,050 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-12-14 15:53:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:47,379 INFO L93 Difference]: Finished difference Result 293 states and 392 transitions. [2022-12-14 15:53:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:47,380 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-12-14 15:53:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:47,381 INFO L225 Difference]: With dead ends: 293 [2022-12-14 15:53:47,381 INFO L226 Difference]: Without dead ends: 288 [2022-12-14 15:53:47,381 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-12-14 15:53:47,382 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 213 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:47,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 240 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-12-14 15:53:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2022-12-14 15:53:47,422 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-12-14 15:53:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 382 transitions. [2022-12-14 15:53:47,423 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 382 transitions. Word has length 48 [2022-12-14 15:53:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:47,423 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 382 transitions. [2022-12-14 15:53:47,423 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-12-14 15:53:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 382 transitions. [2022-12-14 15:53:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 15:53:47,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:47,424 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-12-14 15:53:47,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 15:53:47,424 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1207068698, now seen corresponding path program 1 times [2022-12-14 15:53:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:47,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206863938] [2022-12-14 15:53:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:49,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:49,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206863938] [2022-12-14 15:53:49,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206863938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:49,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:49,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376877525] [2022-12-14 15:53:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:49,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:49,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:49,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:49,482 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-12-14 15:53:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:49,965 INFO L93 Difference]: Finished difference Result 315 states and 410 transitions. [2022-12-14 15:53:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:49,965 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-12-14 15:53:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:49,967 INFO L225 Difference]: With dead ends: 315 [2022-12-14 15:53:49,967 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 15:53:49,967 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-12-14 15:53:49,967 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 133 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:49,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 203 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:53:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 15:53:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2022-12-14 15:53:50,008 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-12-14 15:53:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 381 transitions. [2022-12-14 15:53:50,009 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 381 transitions. Word has length 51 [2022-12-14 15:53:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:50,009 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 381 transitions. [2022-12-14 15:53:50,009 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-12-14 15:53:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-12-14 15:53:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 15:53:50,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:50,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-14 15:53:50,010 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1235987475, now seen corresponding path program 1 times [2022-12-14 15:53:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:50,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960357215] [2022-12-14 15:53:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:50,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960357215] [2022-12-14 15:53:50,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960357215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:50,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:50,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:50,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870631886] [2022-12-14 15:53:50,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:50,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:50,091 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-12-14 15:53:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:50,179 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2022-12-14 15:53:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:50,179 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-12-14 15:53:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:50,180 INFO L225 Difference]: With dead ends: 286 [2022-12-14 15:53:50,180 INFO L226 Difference]: Without dead ends: 281 [2022-12-14 15:53:50,180 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-12-14 15:53:50,181 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:50,181 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.0s Time] [2022-12-14 15:53:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-12-14 15:53:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-12-14 15:53:50,220 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-12-14 15:53:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2022-12-14 15:53:50,221 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 52 [2022-12-14 15:53:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:50,221 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2022-12-14 15:53:50,221 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-12-14 15:53:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2022-12-14 15:53:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 15:53:50,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:50,222 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-12-14 15:53:50,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-14 15:53:50,222 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1909035186, now seen corresponding path program 1 times [2022-12-14 15:53:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:50,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183109566] [2022-12-14 15:53:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:50,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:50,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183109566] [2022-12-14 15:53:50,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183109566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:50,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:50,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044739936] [2022-12-14 15:53:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:50,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:50,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:50,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:50,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:50,912 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-12-14 15:53:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:51,022 INFO L93 Difference]: Finished difference Result 283 states and 373 transitions. [2022-12-14 15:53:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:51,022 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-12-14 15:53:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:51,023 INFO L225 Difference]: With dead ends: 283 [2022-12-14 15:53:51,023 INFO L226 Difference]: Without dead ends: 280 [2022-12-14 15:53:51,023 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-12-14 15:53:51,023 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:51,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 230 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-12-14 15:53:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-12-14 15:53:51,062 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-12-14 15:53:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 369 transitions. [2022-12-14 15:53:51,063 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 369 transitions. Word has length 54 [2022-12-14 15:53:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:51,063 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 369 transitions. [2022-12-14 15:53:51,063 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-12-14 15:53:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 369 transitions. [2022-12-14 15:53:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 15:53:51,064 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:51,064 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-12-14 15:53:51,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 15:53:51,064 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -949842460, now seen corresponding path program 1 times [2022-12-14 15:53:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:51,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686051198] [2022-12-14 15:53:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:53,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686051198] [2022-12-14 15:53:53,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686051198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:53,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501741452] [2022-12-14 15:53:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:53,512 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-12-14 15:53:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:53,835 INFO L93 Difference]: Finished difference Result 282 states and 370 transitions. [2022-12-14 15:53:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:53,836 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-12-14 15:53:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:53,837 INFO L225 Difference]: With dead ends: 282 [2022-12-14 15:53:53,837 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 15:53:53,837 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-12-14 15:53:53,838 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 189 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:53,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 73 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 15:53:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-12-14 15:53:53,877 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-12-14 15:53:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 360 transitions. [2022-12-14 15:53:53,878 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 360 transitions. Word has length 55 [2022-12-14 15:53:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 360 transitions. [2022-12-14 15:53:53,878 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-12-14 15:53:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 360 transitions. [2022-12-14 15:53:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 15:53:53,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:53,878 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-12-14 15:53:53,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-14 15:53:53,878 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1428857774, now seen corresponding path program 1 times [2022-12-14 15:53:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363793576] [2022-12-14 15:53:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:55,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:55,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363793576] [2022-12-14 15:53:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363793576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:55,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:55,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146001255] [2022-12-14 15:53:55,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:55,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:55,206 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-12-14 15:53:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:55,512 INFO L93 Difference]: Finished difference Result 297 states and 377 transitions. [2022-12-14 15:53:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:55,512 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-12-14 15:53:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:55,513 INFO L225 Difference]: With dead ends: 297 [2022-12-14 15:53:55,513 INFO L226 Difference]: Without dead ends: 294 [2022-12-14 15:53:55,513 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-12-14 15:53:55,514 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 94 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:55,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 367 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-12-14 15:53:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-12-14 15:53:55,553 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-12-14 15:53:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 359 transitions. [2022-12-14 15:53:55,553 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 359 transitions. Word has length 59 [2022-12-14 15:53:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:55,554 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 359 transitions. [2022-12-14 15:53:55,554 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-12-14 15:53:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 359 transitions. [2022-12-14 15:53:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 15:53:55,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:55,554 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-12-14 15:53:55,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-14 15:53:55,554 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064462, now seen corresponding path program 1 times [2022-12-14 15:53:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:55,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823038392] [2022-12-14 15:53:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:56,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:56,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823038392] [2022-12-14 15:53:56,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823038392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:56,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:56,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:56,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525944364] [2022-12-14 15:53:56,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:56,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:56,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:56,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:56,915 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-12-14 15:53:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:57,294 INFO L93 Difference]: Finished difference Result 301 states and 379 transitions. [2022-12-14 15:53:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:57,295 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-12-14 15:53:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:57,296 INFO L225 Difference]: With dead ends: 301 [2022-12-14 15:53:57,296 INFO L226 Difference]: Without dead ends: 294 [2022-12-14 15:53:57,296 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-12-14 15:53:57,296 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 93 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:57,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 207 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-12-14 15:53:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2022-12-14 15:53:57,336 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-12-14 15:53:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 356 transitions. [2022-12-14 15:53:57,337 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 356 transitions. Word has length 64 [2022-12-14 15:53:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:57,337 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 356 transitions. [2022-12-14 15:53:57,337 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-12-14 15:53:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 356 transitions. [2022-12-14 15:53:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 15:53:57,338 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:57,338 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-12-14 15:53:57,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-14 15:53:57,338 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1401761456, now seen corresponding path program 1 times [2022-12-14 15:53:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:57,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959909612] [2022-12-14 15:53:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:59,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:59,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959909612] [2022-12-14 15:53:59,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959909612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:59,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395773701] [2022-12-14 15:53:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:59,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:59,095 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-12-14 15:53:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:59,439 INFO L93 Difference]: Finished difference Result 290 states and 366 transitions. [2022-12-14 15:53:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:59,440 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-12-14 15:53:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:59,440 INFO L225 Difference]: With dead ends: 290 [2022-12-14 15:53:59,440 INFO L226 Difference]: Without dead ends: 287 [2022-12-14 15:53:59,441 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-12-14 15:53:59,441 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:59,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 143 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:53:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-14 15:53:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2022-12-14 15:53:59,482 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-12-14 15:53:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2022-12-14 15:53:59,482 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 66 [2022-12-14 15:53:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:59,483 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2022-12-14 15:53:59,483 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-12-14 15:53:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-12-14 15:53:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 15:53:59,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:59,483 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-12-14 15:53:59,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-14 15:53:59,483 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:53:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -505241790, now seen corresponding path program 1 times [2022-12-14 15:53:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:59,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015655837] [2022-12-14 15:53:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:59,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015655837] [2022-12-14 15:53:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015655837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:59,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881118904] [2022-12-14 15:53:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:59,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:59,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:59,979 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-12-14 15:54:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:00,263 INFO L93 Difference]: Finished difference Result 279 states and 356 transitions. [2022-12-14 15:54:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:00,263 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-12-14 15:54:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:00,265 INFO L225 Difference]: With dead ends: 279 [2022-12-14 15:54:00,265 INFO L226 Difference]: Without dead ends: 276 [2022-12-14 15:54:00,265 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-12-14 15:54:00,265 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 175 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:00,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:54:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-14 15:54:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-12-14 15:54:00,307 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-12-14 15:54:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 352 transitions. [2022-12-14 15:54:00,307 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 352 transitions. Word has length 67 [2022-12-14 15:54:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:00,307 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 352 transitions. [2022-12-14 15:54:00,308 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-12-14 15:54:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 352 transitions. [2022-12-14 15:54:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 15:54:00,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:00,308 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-12-14 15:54:00,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-14 15:54:00,308 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1901725405, now seen corresponding path program 1 times [2022-12-14 15:54:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:00,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56123090] [2022-12-14 15:54:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:01,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:01,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56123090] [2022-12-14 15:54:01,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56123090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:54:01,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:54:01,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:54:01,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884657768] [2022-12-14 15:54:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:54:01,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:54:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:54:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:54:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:54:01,840 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-12-14 15:54:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:02,243 INFO L93 Difference]: Finished difference Result 292 states and 365 transitions. [2022-12-14 15:54:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:02,243 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-12-14 15:54:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:02,243 INFO L225 Difference]: With dead ends: 292 [2022-12-14 15:54:02,243 INFO L226 Difference]: Without dead ends: 289 [2022-12-14 15:54:02,244 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-12-14 15:54:02,244 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 110 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:02,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 143 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:54:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-12-14 15:54:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2022-12-14 15:54:02,285 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-12-14 15:54:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 351 transitions. [2022-12-14 15:54:02,286 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 351 transitions. Word has length 70 [2022-12-14 15:54:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:02,286 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 351 transitions. [2022-12-14 15:54:02,286 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-12-14 15:54:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 351 transitions. [2022-12-14 15:54:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 15:54:02,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:02,286 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-12-14 15:54:02,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-14 15:54:02,287 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:02,287 INFO L85 PathProgramCache]: Analyzing trace with hash -892407311, now seen corresponding path program 1 times [2022-12-14 15:54:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:02,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307703254] [2022-12-14 15:54:02,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:02,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:02,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307703254] [2022-12-14 15:54:02,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307703254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:54:02,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:54:02,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:54:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740719129] [2022-12-14 15:54:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:54:02,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:54:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:54:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:54:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:54:02,745 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-12-14 15:54:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:02,941 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2022-12-14 15:54:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:02,941 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-12-14 15:54:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:02,943 INFO L225 Difference]: With dead ends: 296 [2022-12-14 15:54:02,943 INFO L226 Difference]: Without dead ends: 290 [2022-12-14 15:54:02,943 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-12-14 15:54:02,943 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 54 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:02,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 464 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:54:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-12-14 15:54:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2022-12-14 15:54:02,985 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-12-14 15:54:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 349 transitions. [2022-12-14 15:54:02,986 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 349 transitions. Word has length 73 [2022-12-14 15:54:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:02,986 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 349 transitions. [2022-12-14 15:54:02,986 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-12-14 15:54:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 349 transitions. [2022-12-14 15:54:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 15:54:02,986 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:02,986 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-12-14 15:54:02,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-14 15:54:02,986 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1895084956, now seen corresponding path program 1 times [2022-12-14 15:54:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:02,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118922497] [2022-12-14 15:54:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:04,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118922497] [2022-12-14 15:54:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118922497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:54:04,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:54:04,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:54:04,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172893382] [2022-12-14 15:54:04,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:54:04,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:54:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:54:04,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:54:04,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:54:04,455 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-12-14 15:54:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:04,780 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2022-12-14 15:54:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:04,780 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-12-14 15:54:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:04,781 INFO L225 Difference]: With dead ends: 278 [2022-12-14 15:54:04,781 INFO L226 Difference]: Without dead ends: 275 [2022-12-14 15:54:04,781 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-12-14 15:54:04,781 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 166 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:04,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 222 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:54:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-12-14 15:54:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-12-14 15:54:04,822 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-12-14 15:54:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 346 transitions. [2022-12-14 15:54:04,823 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 346 transitions. Word has length 74 [2022-12-14 15:54:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:04,823 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 346 transitions. [2022-12-14 15:54:04,823 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-12-14 15:54:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 346 transitions. [2022-12-14 15:54:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 15:54:04,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:04,824 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-12-14 15:54:04,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-14 15:54:04,824 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1587511931, now seen corresponding path program 1 times [2022-12-14 15:54:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:04,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23068084] [2022-12-14 15:54:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:06,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:06,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23068084] [2022-12-14 15:54:06,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23068084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:54:06,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:54:06,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:54:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101001371] [2022-12-14 15:54:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:54:06,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:54:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:54:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:54:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:54:06,561 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-12-14 15:54:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:06,891 INFO L93 Difference]: Finished difference Result 289 states and 357 transitions. [2022-12-14 15:54:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:06,891 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-12-14 15:54:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:06,891 INFO L225 Difference]: With dead ends: 289 [2022-12-14 15:54:06,892 INFO L226 Difference]: Without dead ends: 282 [2022-12-14 15:54:06,892 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-12-14 15:54:06,892 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:06,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 147 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:54:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-12-14 15:54:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-12-14 15:54:06,944 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-12-14 15:54:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 341 transitions. [2022-12-14 15:54:06,944 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 341 transitions. Word has length 81 [2022-12-14 15:54:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:06,944 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 341 transitions. [2022-12-14 15:54:06,944 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-12-14 15:54:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 341 transitions. [2022-12-14 15:54:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 15:54:06,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:06,945 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-12-14 15:54:06,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-14 15:54:06,945 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1079023560, now seen corresponding path program 1 times [2022-12-14 15:54:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:06,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95091449] [2022-12-14 15:54:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:08,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:08,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95091449] [2022-12-14 15:54:08,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95091449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:54:08,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:54:08,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:54:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543073210] [2022-12-14 15:54:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:54:08,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:54:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:54:08,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:54:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:54:08,476 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-12-14 15:54:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:08,689 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2022-12-14 15:54:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:54:08,690 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-12-14 15:54:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:54:08,691 INFO L225 Difference]: With dead ends: 287 [2022-12-14 15:54:08,691 INFO L226 Difference]: Without dead ends: 282 [2022-12-14 15:54:08,691 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-12-14 15:54:08,691 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 24 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:54:08,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 482 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:54:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-12-14 15:54:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-12-14 15:54:08,733 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-12-14 15:54:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2022-12-14 15:54:08,734 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 95 [2022-12-14 15:54:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:54:08,734 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2022-12-14 15:54:08,734 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-12-14 15:54:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2022-12-14 15:54:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 15:54:08,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:54:08,735 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-12-14 15:54:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-14 15:54:08,735 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:54:08,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:54:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 275939282, now seen corresponding path program 1 times [2022-12-14 15:54:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:54:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736520473] [2022-12-14 15:54:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:54:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:54:50,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:54:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736520473] [2022-12-14 15:54:50,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736520473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:54:50,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951835183] [2022-12-14 15:54:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:54:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:54:50,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:54:50,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:54:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:51,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 15:54:51,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:56:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:56:27,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:58:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 15:58:06,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951835183] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:58:06,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:58:06,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 4] total 9 [2022-12-14 15:58:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009178043] [2022-12-14 15:58:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:58:06,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:58:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:58:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:58:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:58:06,666 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-12-14 15:58:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:58:06,740 INFO L93 Difference]: Finished difference Result 277 states and 339 transitions. [2022-12-14 15:58:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:58:06,741 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-12-14 15:58:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:58:06,741 INFO L225 Difference]: With dead ends: 277 [2022-12-14 15:58:06,742 INFO L226 Difference]: Without dead ends: 274 [2022-12-14 15:58:06,742 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-12-14 15:58:06,742 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-12-14 15:58:06,742 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-12-14 15:58:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-12-14 15:58:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-12-14 15:58:06,783 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-12-14 15:58:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2022-12-14 15:58:06,784 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 111 [2022-12-14 15:58:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:58:06,784 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2022-12-14 15:58:06,784 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-12-14 15:58:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2022-12-14 15:58:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 15:58:06,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:58:06,785 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-12-14 15:58:06,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:58:06,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-14 15:58:06,986 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:58:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:58:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1132823590, now seen corresponding path program 1 times [2022-12-14 15:58:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:58:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940290706] [2022-12-14 15:58:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:58:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:58:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:58:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:58:11,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:58:11,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940290706] [2022-12-14 15:58:11,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940290706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:58:11,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263294459] [2022-12-14 15:58:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:58:11,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:58:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:58:11,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:58:11,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88f0d5a9-3dbc-4b1b-aa26-5c5154217ff3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:58:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:58:12,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 15:58:12,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:59:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:59:34,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:03:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:03:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263294459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:03:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199044529] [2022-12-14 16:03:11,034 INFO L159 IcfgInterpreter]: Started Sifa with 107 locations of interest [2022-12-14 16:03:11,034 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 16:03:11,036 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 16:03:11,040 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 16:03:11,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 16:03:11,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26