./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI --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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- 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-5e519f3 [2022-11-03 03:28:54,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:28:54,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:28:54,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:28:54,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:28:54,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:28:54,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:28:54,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:28:54,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:28:54,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:28:54,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:28:54,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:28:54,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:28:54,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:28:54,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:28:54,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:28:54,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:28:54,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:28:54,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:28:54,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:28:54,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:28:54,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:28:54,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:28:54,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:28:54,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:28:54,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:28:54,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:28:54,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:28:54,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:28:54,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:28:54,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:28:54,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:28:54,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:28:54,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:28:54,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:28:54,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:28:54,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:28:54,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:28:54,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:28:54,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:28:54,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:28:54,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:28:54,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:28:54,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:28:54,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:28:54,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:28:54,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:28:54,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:28:54,624 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:28:54,625 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:28:54,625 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:28:54,625 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:28:54,626 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:28:54,626 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:28:54,627 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:28:54,627 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:28:54,627 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:28:54,627 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:28:54,628 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:28:54,628 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:28:54,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:28:54,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:28:54,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:28:54,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:28:54,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:28:54,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:28:54,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:28:54,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:28:54,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:28:54,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:28:54,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:28:54,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:28:54,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:28:54,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:28:54,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:28:54,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:28:54,633 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:28:54,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:28:54,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:28:54,633 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:28:54,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:28:54,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:28:54,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:28:54,634 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_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/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_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2022-11-03 03:28:54,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:28:54,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:28:54,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:28:54,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:28:54,923 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:28:54,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-03 03:28:54,995 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/data/56ba2cb77/7d66e08992384f6b9907f7bcf3b18d08/FLAG7aa72201a [2022-11-03 03:28:55,512 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:28:55,513 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-03 03:28:55,528 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/data/56ba2cb77/7d66e08992384f6b9907f7bcf3b18d08/FLAG7aa72201a [2022-11-03 03:28:55,821 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/data/56ba2cb77/7d66e08992384f6b9907f7bcf3b18d08 [2022-11-03 03:28:55,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:28:55,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:28:55,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:28:55,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:28:55,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:28:55,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:28:55" (1/1) ... [2022-11-03 03:28:55,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3b887d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:55, skipping insertion in model container [2022-11-03 03:28:55,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:28:55" (1/1) ... [2022-11-03 03:28:55,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:28:55,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:28:56,347 WARN L230 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_a306f563-87f1-4f4c-9cc5-a51725d45151/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-03 03:28:56,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:28:56,390 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:28:56,473 WARN L230 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_a306f563-87f1-4f4c-9cc5-a51725d45151/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-03 03:28:56,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:28:56,510 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:28:56,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56 WrapperNode [2022-11-03 03:28:56,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:28:56,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:28:56,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:28:56,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:28:56,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,608 INFO L138 Inliner]: procedures = 184, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2022-11-03 03:28:56,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:28:56,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:28:56,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:28:56,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:28:56,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:28:56,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:28:56,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:28:56,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:28:56,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (1/1) ... [2022-11-03 03:28:56,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:28:56,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:28:56,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:28:56,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:28:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:28:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-03 03:28:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-03 03:28:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-11-03 03:28:56,770 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-11-03 03:28:56,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:28:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:28:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-11-03 03:28:56,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-11-03 03:28:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:28:56,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:28:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:28:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-11-03 03:28:56,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-11-03 03:28:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2022-11-03 03:28:56,772 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2022-11-03 03:28:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-11-03 03:28:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-11-03 03:28:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:28:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-11-03 03:28:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-11-03 03:28:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:28:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-11-03 03:28:56,774 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-11-03 03:28:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:28:56,774 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-11-03 03:28:56,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-11-03 03:28:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-03 03:28:56,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:28:56,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:28:57,013 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:28:57,019 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:28:57,799 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:28:58,003 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:28:58,003 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:28:58,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:28:58 BoogieIcfgContainer [2022-11-03 03:28:58,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:28:58,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:28:58,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:28:58,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:28:58,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:28:55" (1/3) ... [2022-11-03 03:28:58,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b18e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:28:58, skipping insertion in model container [2022-11-03 03:28:58,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:28:56" (2/3) ... [2022-11-03 03:28:58,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b18e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:28:58, skipping insertion in model container [2022-11-03 03:28:58,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:28:58" (3/3) ... [2022-11-03 03:28:58,019 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2022-11-03 03:28:58,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:28:58,039 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:28:58,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:28:58,126 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;@4eb0aab4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:28:58,126 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:28:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-03 03:28:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:28:58,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:28:58,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:28:58,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:28:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:28:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1588735395, now seen corresponding path program 1 times [2022-11-03 03:28:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:28:58,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597257146] [2022-11-03 03:28:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:28:58,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:28:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:28:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:28:59,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:28:59,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597257146] [2022-11-03 03:28:59,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597257146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:28:59,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:28:59,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:28:59,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004531255] [2022-11-03 03:28:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:28:59,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:28:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:28:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:28:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:28:59,338 INFO L87 Difference]: Start difference. First operand has 106 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:29:01,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:05,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:07,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:09,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:11,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:13,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:13,946 INFO L93 Difference]: Finished difference Result 228 states and 330 transitions. [2022-11-03 03:29:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:29:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-03 03:29:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:13,966 INFO L225 Difference]: With dead ends: 228 [2022-11-03 03:29:13,967 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 03:29:13,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:29:13,977 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 27 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:13,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 734 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 14.5s Time] [2022-11-03 03:29:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 03:29:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-03 03:29:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.289855072463768) internal successors, (89), 72 states have internal predecessors, (89), 30 states have call successors, (30), 10 states have call predecessors, (30), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-03 03:29:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2022-11-03 03:29:14,039 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 16 [2022-11-03 03:29:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:14,040 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2022-11-03 03:29:14,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 03:29:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2022-11-03 03:29:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:29:14,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:14,043 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 03:29:14,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:29:14,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2009861074, now seen corresponding path program 1 times [2022-11-03 03:29:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065541232] [2022-11-03 03:29:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:15,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065541232] [2022-11-03 03:29:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065541232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:29:16,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017229976] [2022-11-03 03:29:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:29:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:29:16,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:29:16,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:29:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:16,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 03:29:16,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:29:16,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:29:16,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:29:16,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:29:16,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2022-11-03 03:29:16,771 INFO L356 Elim1Store]: treesize reduction 122, result has 26.9 percent of original size [2022-11-03 03:29:16,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 130 [2022-11-03 03:29:16,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2022-11-03 03:29:16,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-03 03:29:16,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2022-11-03 03:29:16,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-11-03 03:29:16,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2022-11-03 03:29:17,021 INFO L356 Elim1Store]: treesize reduction 40, result has 56.0 percent of original size [2022-11-03 03:29:17,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 82 [2022-11-03 03:29:17,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2022-11-03 03:29:17,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:29:17,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:29:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:29:17,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:29:17,409 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-03 03:29:17,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 101 [2022-11-03 03:29:17,440 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-03 03:29:17,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 91 [2022-11-03 03:29:17,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 03:29:17,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 03:29:17,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-11-03 03:29:17,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-11-03 03:29:18,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int)) (|v_system_initialize_~#e~1.base_14| Int)) (let ((.cse0 (store |c_#memory_int| c_~user~0.base (store (select |c_#memory_int| c_~user~0.base) c_~user~0.offset ~sys_state_s~0~AS_START)))) (or (not (= (select (select .cse0 |v_system_initialize_~#e~1.base_14|) 0) 0)) (not (= ~sys_state_s~0~AS_IDLE (select (select (store .cse0 |v_system_initialize_~#e~1.base_14| v_ArrVal_295) c_~user~0.base) c_~user~0.offset)))))) is different from false [2022-11-03 03:29:18,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017229976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:29:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1100864946] [2022-11-03 03:29:18,883 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 03:29:18,883 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:29:18,887 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:29:18,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:29:18,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 [2022-11-03 03:29:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760564620] [2022-11-03 03:29:18,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:29:18,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 03:29:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 03:29:18,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=889, Unknown=1, NotChecked=60, Total=1056 [2022-11-03 03:29:18,894 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (14), 13 states have call predecessors, (14), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:29:24,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:27,701 INFO L93 Difference]: Finished difference Result 440 states and 606 transitions. [2022-11-03 03:29:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 03:29:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (14), 13 states have call predecessors, (14), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2022-11-03 03:29:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:27,705 INFO L225 Difference]: With dead ends: 440 [2022-11-03 03:29:27,705 INFO L226 Difference]: Without dead ends: 206 [2022-11-03 03:29:27,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=630, Invalid=3033, Unknown=1, NotChecked=118, Total=3782 [2022-11-03 03:29:27,709 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 591 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 499 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:27,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1910 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 2408 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-11-03 03:29:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-03 03:29:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2022-11-03 03:29:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 117 states have internal predecessors, (138), 54 states have call successors, (54), 21 states have call predecessors, (54), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-03 03:29:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2022-11-03 03:29:27,737 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 29 [2022-11-03 03:29:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:27,738 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2022-11-03 03:29:27,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (14), 13 states have call predecessors, (14), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 03:29:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2022-11-03 03:29:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 03:29:27,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:27,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-03 03:29:27,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:29:27,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:29:27,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1966949727, now seen corresponding path program 1 times [2022-11-03 03:29:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478922208] [2022-11-03 03:29:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:29:29,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:29,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478922208] [2022-11-03 03:29:29,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478922208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:29,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:29,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:29:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698467553] [2022-11-03 03:29:29,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:29,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:29:29,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:29,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:29:29,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:29:29,210 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:29:32,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:32,867 INFO L93 Difference]: Finished difference Result 377 states and 523 transitions. [2022-11-03 03:29:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:29:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-11-03 03:29:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:32,870 INFO L225 Difference]: With dead ends: 377 [2022-11-03 03:29:32,871 INFO L226 Difference]: Without dead ends: 207 [2022-11-03 03:29:32,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:29:32,873 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 34 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:32,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 780 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 03:29:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-03 03:29:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2022-11-03 03:29:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 135 states have internal predecessors, (161), 57 states have call successors, (57), 23 states have call predecessors, (57), 15 states have return successors, (45), 41 states have call predecessors, (45), 43 states have call successors, (45) [2022-11-03 03:29:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 263 transitions. [2022-11-03 03:29:32,898 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 263 transitions. Word has length 44 [2022-11-03 03:29:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 263 transitions. [2022-11-03 03:29:32,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:29:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 263 transitions. [2022-11-03 03:29:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 03:29:32,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:32,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-03 03:29:32,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:29:32,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1829694866, now seen corresponding path program 1 times [2022-11-03 03:29:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:32,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438319982] [2022-11-03 03:29:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:29:33,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:33,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438319982] [2022-11-03 03:29:33,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438319982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:33,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:33,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:29:33,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577179230] [2022-11-03 03:29:33,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:33,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:29:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:29:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:33,153 INFO L87 Difference]: Start difference. First operand 200 states and 263 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:29:35,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:37,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:39,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:41,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:41,574 INFO L93 Difference]: Finished difference Result 405 states and 562 transitions. [2022-11-03 03:29:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:29:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-03 03:29:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:41,577 INFO L225 Difference]: With dead ends: 405 [2022-11-03 03:29:41,578 INFO L226 Difference]: Without dead ends: 212 [2022-11-03 03:29:41,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:41,580 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:41,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 457 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2022-11-03 03:29:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-03 03:29:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2022-11-03 03:29:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 139 states have internal predecessors, (166), 57 states have call successors, (57), 23 states have call predecessors, (57), 16 states have return successors, (51), 43 states have call predecessors, (51), 43 states have call successors, (51) [2022-11-03 03:29:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 274 transitions. [2022-11-03 03:29:41,638 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 274 transitions. Word has length 48 [2022-11-03 03:29:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:41,639 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 274 transitions. [2022-11-03 03:29:41,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:29:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 274 transitions. [2022-11-03 03:29:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 03:29:41,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:41,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-03 03:29:41,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:29:41,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash 516321036, now seen corresponding path program 1 times [2022-11-03 03:29:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:41,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582535405] [2022-11-03 03:29:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 03:29:41,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:41,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582535405] [2022-11-03 03:29:41,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582535405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:41,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:41,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:29:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49839077] [2022-11-03 03:29:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:41,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:29:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:29:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:41,958 INFO L87 Difference]: Start difference. First operand 206 states and 274 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:29:44,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:44,854 INFO L93 Difference]: Finished difference Result 415 states and 577 transitions. [2022-11-03 03:29:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:29:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-11-03 03:29:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:44,859 INFO L225 Difference]: With dead ends: 415 [2022-11-03 03:29:44,859 INFO L226 Difference]: Without dead ends: 216 [2022-11-03 03:29:44,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:29:44,861 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:44,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 457 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-11-03 03:29:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-03 03:29:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2022-11-03 03:29:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 136 states have (on average 1.25) internal successors, (170), 141 states have internal predecessors, (170), 57 states have call successors, (57), 23 states have call predecessors, (57), 16 states have return successors, (51), 45 states have call predecessors, (51), 43 states have call successors, (51) [2022-11-03 03:29:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 278 transitions. [2022-11-03 03:29:44,898 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 278 transitions. Word has length 49 [2022-11-03 03:29:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:44,899 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 278 transitions. [2022-11-03 03:29:44,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-03 03:29:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 278 transitions. [2022-11-03 03:29:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 03:29:44,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:44,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-03 03:29:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:29:44,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1543435287, now seen corresponding path program 1 times [2022-11-03 03:29:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:44,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442418191] [2022-11-03 03:29:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:45,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:45,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442418191] [2022-11-03 03:29:45,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442418191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:45,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:45,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:29:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654596691] [2022-11-03 03:29:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:45,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:29:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:29:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:29:45,842 INFO L87 Difference]: Start difference. First operand 210 states and 278 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:29:49,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:49,412 INFO L93 Difference]: Finished difference Result 447 states and 626 transitions. [2022-11-03 03:29:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:29:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-11-03 03:29:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:49,415 INFO L225 Difference]: With dead ends: 447 [2022-11-03 03:29:49,415 INFO L226 Difference]: Without dead ends: 244 [2022-11-03 03:29:49,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:29:49,417 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 31 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:49,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 700 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-11-03 03:29:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-03 03:29:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2022-11-03 03:29:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 159 states have internal predecessors, (195), 61 states have call successors, (61), 27 states have call predecessors, (61), 17 states have return successors, (54), 45 states have call predecessors, (54), 45 states have call successors, (54) [2022-11-03 03:29:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 310 transitions. [2022-11-03 03:29:49,440 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 310 transitions. Word has length 52 [2022-11-03 03:29:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:49,440 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 310 transitions. [2022-11-03 03:29:49,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:29:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-11-03 03:29:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-03 03:29:49,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:49,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-03 03:29:49,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:29:49,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 932545388, now seen corresponding path program 1 times [2022-11-03 03:29:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819647716] [2022-11-03 03:29:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:50,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:50,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819647716] [2022-11-03 03:29:50,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819647716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:50,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:50,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:29:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861780806] [2022-11-03 03:29:50,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:50,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:29:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:50,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:29:50,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:29:50,597 INFO L87 Difference]: Start difference. First operand 232 states and 310 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:29:53,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:53,704 INFO L93 Difference]: Finished difference Result 508 states and 713 transitions. [2022-11-03 03:29:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:29:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-11-03 03:29:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:53,708 INFO L225 Difference]: With dead ends: 508 [2022-11-03 03:29:53,709 INFO L226 Difference]: Without dead ends: 283 [2022-11-03 03:29:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:29:53,711 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 36 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:53,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 871 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-11-03 03:29:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-03 03:29:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 266. [2022-11-03 03:29:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 186 states have internal predecessors, (229), 67 states have call successors, (67), 31 states have call predecessors, (67), 20 states have return successors, (60), 48 states have call predecessors, (60), 49 states have call successors, (60) [2022-11-03 03:29:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 356 transitions. [2022-11-03 03:29:53,749 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 356 transitions. Word has length 53 [2022-11-03 03:29:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:53,750 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 356 transitions. [2022-11-03 03:29:53,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:29:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 356 transitions. [2022-11-03 03:29:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 03:29:53,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:53,754 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:29:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:29:53,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1730045334, now seen corresponding path program 2 times [2022-11-03 03:29:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:53,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586754387] [2022-11-03 03:29:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:54,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586754387] [2022-11-03 03:29:54,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586754387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:29:54,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:29:54,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:29:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474128535] [2022-11-03 03:29:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:29:54,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:29:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:29:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:29:54,807 INFO L87 Difference]: Start difference. First operand 266 states and 356 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:29:57,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:29:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:29:57,988 INFO L93 Difference]: Finished difference Result 542 states and 753 transitions. [2022-11-03 03:29:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:29:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-11-03 03:29:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:29:57,991 INFO L225 Difference]: With dead ends: 542 [2022-11-03 03:29:57,991 INFO L226 Difference]: Without dead ends: 283 [2022-11-03 03:29:57,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:29:57,994 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 32 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:29:57,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 646 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-03 03:29:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-03 03:29:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 272. [2022-11-03 03:29:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 190 states have internal predecessors, (233), 68 states have call successors, (68), 32 states have call predecessors, (68), 21 states have return successors, (61), 49 states have call predecessors, (61), 50 states have call successors, (61) [2022-11-03 03:29:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 362 transitions. [2022-11-03 03:29:58,016 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 362 transitions. Word has length 57 [2022-11-03 03:29:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:29:58,017 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 362 transitions. [2022-11-03 03:29:58,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:29:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 362 transitions. [2022-11-03 03:29:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 03:29:58,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:29:58,019 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2022-11-03 03:29:58,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:29:58,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:29:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:29:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 920233900, now seen corresponding path program 1 times [2022-11-03 03:29:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:29:58,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215326809] [2022-11-03 03:29:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:29:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:58,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:29:58,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215326809] [2022-11-03 03:29:58,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215326809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:29:58,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878199039] [2022-11-03 03:29:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:29:58,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:29:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:29:58,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:29:58,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:29:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:29:59,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:29:59,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:29:59,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:29:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:59,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:29:59,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:29:59,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:29:59,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:29:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:29:59,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878199039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:29:59,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956922979] [2022-11-03 03:29:59,642 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2022-11-03 03:29:59,642 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:29:59,642 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:29:59,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:29:59,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-03 03:29:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239488878] [2022-11-03 03:29:59,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:29:59,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:29:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:29:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:29:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:29:59,646 INFO L87 Difference]: Start difference. First operand 272 states and 362 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-03 03:30:02,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:02,935 INFO L93 Difference]: Finished difference Result 613 states and 864 transitions. [2022-11-03 03:30:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:30:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2022-11-03 03:30:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:02,938 INFO L225 Difference]: With dead ends: 613 [2022-11-03 03:30:02,938 INFO L226 Difference]: Without dead ends: 342 [2022-11-03 03:30:02,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:30:02,943 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 87 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:02,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 590 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 03:30:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-03 03:30:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2022-11-03 03:30:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 219 states have (on average 1.2420091324200913) internal successors, (272), 225 states have internal predecessors, (272), 71 states have call successors, (71), 33 states have call predecessors, (71), 35 states have return successors, (108), 67 states have call predecessors, (108), 53 states have call successors, (108) [2022-11-03 03:30:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 451 transitions. [2022-11-03 03:30:02,976 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 451 transitions. Word has length 54 [2022-11-03 03:30:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:02,976 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 451 transitions. [2022-11-03 03:30:02,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-03 03:30:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions. [2022-11-03 03:30:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 03:30:02,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:02,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 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] [2022-11-03 03:30:03,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:30:03,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:30:03,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1197967254, now seen corresponding path program 1 times [2022-11-03 03:30:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341699950] [2022-11-03 03:30:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:05,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341699950] [2022-11-03 03:30:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341699950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:30:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:30:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:30:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87881512] [2022-11-03 03:30:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:30:05,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:30:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:30:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:30:05,321 INFO L87 Difference]: Start difference. First operand 326 states and 451 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:09,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:11,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:13,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:14,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:16,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:18,416 INFO L93 Difference]: Finished difference Result 1029 states and 1586 transitions. [2022-11-03 03:30:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:30:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-11-03 03:30:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:18,425 INFO L225 Difference]: With dead ends: 1029 [2022-11-03 03:30:18,425 INFO L226 Difference]: Without dead ends: 710 [2022-11-03 03:30:18,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:30:18,428 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 307 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 156 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:18,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 820 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 886 Invalid, 4 Unknown, 0 Unchecked, 12.8s Time] [2022-11-03 03:30:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-03 03:30:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 646. [2022-11-03 03:30:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 448 states have (on average 1.1964285714285714) internal successors, (536), 437 states have internal predecessors, (536), 100 states have call successors, (100), 46 states have call predecessors, (100), 97 states have return successors, (326), 162 states have call predecessors, (326), 75 states have call successors, (326) [2022-11-03 03:30:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 962 transitions. [2022-11-03 03:30:18,489 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 962 transitions. Word has length 59 [2022-11-03 03:30:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:18,490 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 962 transitions. [2022-11-03 03:30:18,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 962 transitions. [2022-11-03 03:30:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 03:30:18,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:18,493 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-03 03:30:18,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:30:18,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash -400297083, now seen corresponding path program 1 times [2022-11-03 03:30:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:18,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794832825] [2022-11-03 03:30:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:19,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794832825] [2022-11-03 03:30:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794832825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:30:19,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:30:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:30:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008562253] [2022-11-03 03:30:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:30:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:30:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:30:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:30:19,529 INFO L87 Difference]: Start difference. First operand 646 states and 962 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:23,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:23,369 INFO L93 Difference]: Finished difference Result 1305 states and 2185 transitions. [2022-11-03 03:30:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:30:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-11-03 03:30:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:23,376 INFO L225 Difference]: With dead ends: 1305 [2022-11-03 03:30:23,376 INFO L226 Difference]: Without dead ends: 666 [2022-11-03 03:30:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:30:23,382 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 31 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:23,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 642 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-03 03:30:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-03 03:30:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 656. [2022-11-03 03:30:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 456 states have (on average 1.1995614035087718) internal successors, (547), 445 states have internal predecessors, (547), 101 states have call successors, (101), 47 states have call predecessors, (101), 98 states have return successors, (333), 163 states have call predecessors, (333), 76 states have call successors, (333) [2022-11-03 03:30:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 981 transitions. [2022-11-03 03:30:23,434 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 981 transitions. Word has length 60 [2022-11-03 03:30:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:23,434 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 981 transitions. [2022-11-03 03:30:23,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 981 transitions. [2022-11-03 03:30:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 03:30:23,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:23,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-03 03:30:23,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:30:23,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 680771221, now seen corresponding path program 1 times [2022-11-03 03:30:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:23,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185945916] [2022-11-03 03:30:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:24,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185945916] [2022-11-03 03:30:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185945916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:30:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:30:24,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:30:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146102968] [2022-11-03 03:30:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:30:24,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 03:30:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:24,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 03:30:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:30:24,482 INFO L87 Difference]: Start difference. First operand 656 states and 981 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:27,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:27,949 INFO L93 Difference]: Finished difference Result 1321 states and 2206 transitions. [2022-11-03 03:30:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:30:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-11-03 03:30:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:27,956 INFO L225 Difference]: With dead ends: 1321 [2022-11-03 03:30:27,956 INFO L226 Difference]: Without dead ends: 672 [2022-11-03 03:30:27,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:30:27,961 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 49 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:27,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 757 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-11-03 03:30:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-11-03 03:30:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 659. [2022-11-03 03:30:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 458 states have (on average 1.1965065502183405) internal successors, (548), 448 states have internal predecessors, (548), 101 states have call successors, (101), 47 states have call predecessors, (101), 99 states have return successors, (328), 163 states have call predecessors, (328), 76 states have call successors, (328) [2022-11-03 03:30:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 977 transitions. [2022-11-03 03:30:28,013 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 977 transitions. Word has length 60 [2022-11-03 03:30:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:28,013 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 977 transitions. [2022-11-03 03:30:28,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:30:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 977 transitions. [2022-11-03 03:30:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 03:30:28,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:28,016 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-03 03:30:28,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:30:28,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash -643635002, now seen corresponding path program 1 times [2022-11-03 03:30:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:28,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704988182] [2022-11-03 03:30:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:28,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:28,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704988182] [2022-11-03 03:30:28,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704988182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:30:28,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419160696] [2022-11-03 03:30:28,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:30:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:30:28,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:30:28,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:30:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:29,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 03:30:29,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:30:29,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 03:30:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:29,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:30:29,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 03:30:29,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 03:30:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:29,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419160696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:30:29,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [36328882] [2022-11-03 03:30:29,960 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-03 03:30:29,961 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:30:29,961 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:30:29,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:30:29,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-11-03 03:30:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490579695] [2022-11-03 03:30:29,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:30:29,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:30:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:30:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:30:29,965 INFO L87 Difference]: Start difference. First operand 659 states and 977 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:30:32,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:33,906 INFO L93 Difference]: Finished difference Result 1573 states and 2780 transitions. [2022-11-03 03:30:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:30:33,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2022-11-03 03:30:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:33,916 INFO L225 Difference]: With dead ends: 1573 [2022-11-03 03:30:33,916 INFO L226 Difference]: Without dead ends: 921 [2022-11-03 03:30:33,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:30:33,923 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 212 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 131 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:33,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 688 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-03 03:30:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-03 03:30:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 846. [2022-11-03 03:30:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 597 states have (on average 1.1842546063651591) internal successors, (707), 566 states have internal predecessors, (707), 114 states have call successors, (114), 54 states have call predecessors, (114), 134 states have return successors, (600), 225 states have call predecessors, (600), 86 states have call successors, (600) [2022-11-03 03:30:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1421 transitions. [2022-11-03 03:30:34,010 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1421 transitions. Word has length 59 [2022-11-03 03:30:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:34,010 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1421 transitions. [2022-11-03 03:30:34,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-03 03:30:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1421 transitions. [2022-11-03 03:30:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-03 03:30:34,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:34,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-03 03:30:34,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:30:34,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:30:34,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 744019449, now seen corresponding path program 1 times [2022-11-03 03:30:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258223576] [2022-11-03 03:30:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:35,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258223576] [2022-11-03 03:30:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258223576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:30:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882753671] [2022-11-03 03:30:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:35,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:30:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:30:35,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:30:35,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:30:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:35,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 03:30:35,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:30:35,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:30:35,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:30:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:35,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:30:36,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 03:30:36,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 03:30:36,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 03:30:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 03:30:36,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882753671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:30:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222019564] [2022-11-03 03:30:36,296 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-03 03:30:36,296 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:30:36,296 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:30:36,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:30:36,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-03 03:30:36,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066639371] [2022-11-03 03:30:36,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:30:36,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:30:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:36,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:30:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:30:36,300 INFO L87 Difference]: Start difference. First operand 846 states and 1421 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 5 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 03:30:39,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:40,870 INFO L93 Difference]: Finished difference Result 2473 states and 6238 transitions. [2022-11-03 03:30:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 03:30:40,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 5 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 62 [2022-11-03 03:30:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:40,893 INFO L225 Difference]: With dead ends: 2473 [2022-11-03 03:30:40,894 INFO L226 Difference]: Without dead ends: 1634 [2022-11-03 03:30:40,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:30:40,906 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 282 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 192 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:40,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1127 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 828 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 03:30:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2022-11-03 03:30:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1436. [2022-11-03 03:30:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1024 states have (on average 1.1328125) internal successors, (1160), 981 states have internal predecessors, (1160), 130 states have call successors, (130), 59 states have call predecessors, (130), 281 states have return successors, (2284), 395 states have call predecessors, (2284), 104 states have call successors, (2284) [2022-11-03 03:30:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3574 transitions. [2022-11-03 03:30:41,159 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 3574 transitions. Word has length 62 [2022-11-03 03:30:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:41,159 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 3574 transitions. [2022-11-03 03:30:41,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 5 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-03 03:30:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 3574 transitions. [2022-11-03 03:30:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-03 03:30:41,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:41,165 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:30:41,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:30:41,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:30:41,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:41,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1882473841, now seen corresponding path program 1 times [2022-11-03 03:30:41,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:41,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102055033] [2022-11-03 03:30:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:41,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 03:30:42,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:42,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102055033] [2022-11-03 03:30:42,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102055033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:30:42,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:30:42,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:30:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276541516] [2022-11-03 03:30:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:30:42,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:30:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:30:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:30:42,128 INFO L87 Difference]: Start difference. First operand 1436 states and 3574 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 03:30:45,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:45,883 INFO L93 Difference]: Finished difference Result 2907 states and 9251 transitions. [2022-11-03 03:30:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:30:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 81 [2022-11-03 03:30:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:45,905 INFO L225 Difference]: With dead ends: 2907 [2022-11-03 03:30:45,905 INFO L226 Difference]: Without dead ends: 1477 [2022-11-03 03:30:45,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:30:45,927 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 11 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:45,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1228 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-11-03 03:30:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-11-03 03:30:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1439. [2022-11-03 03:30:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1026 states have (on average 1.1325536062378168) internal successors, (1162), 983 states have internal predecessors, (1162), 130 states have call successors, (130), 59 states have call predecessors, (130), 282 states have return successors, (2290), 396 states have call predecessors, (2290), 104 states have call successors, (2290) [2022-11-03 03:30:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 3582 transitions. [2022-11-03 03:30:46,216 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 3582 transitions. Word has length 81 [2022-11-03 03:30:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:46,217 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 3582 transitions. [2022-11-03 03:30:46,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 03:30:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 3582 transitions. [2022-11-03 03:30:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-03 03:30:46,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:46,222 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 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] [2022-11-03 03:30:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:30:46,222 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1611785923, now seen corresponding path program 1 times [2022-11-03 03:30:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:46,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845156669] [2022-11-03 03:30:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:30:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 03:30:46,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:30:46,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845156669] [2022-11-03 03:30:46,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845156669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:30:46,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:30:46,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 03:30:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799299344] [2022-11-03 03:30:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:30:46,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:30:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:30:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:30:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:30:46,908 INFO L87 Difference]: Start difference. First operand 1439 states and 3582 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-03 03:30:50,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:30:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:30:50,440 INFO L93 Difference]: Finished difference Result 2910 states and 9259 transitions. [2022-11-03 03:30:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:30:50,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2022-11-03 03:30:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:30:50,462 INFO L225 Difference]: With dead ends: 2910 [2022-11-03 03:30:50,462 INFO L226 Difference]: Without dead ends: 1477 [2022-11-03 03:30:50,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:30:50,480 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 11 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:30:50,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1228 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-11-03 03:30:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-11-03 03:30:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1439. [2022-11-03 03:30:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1026 states have (on average 1.1325536062378168) internal successors, (1162), 983 states have internal predecessors, (1162), 130 states have call successors, (130), 59 states have call predecessors, (130), 282 states have return successors, (2290), 396 states have call predecessors, (2290), 104 states have call successors, (2290) [2022-11-03 03:30:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 3582 transitions. [2022-11-03 03:30:50,708 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 3582 transitions. Word has length 82 [2022-11-03 03:30:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:30:50,709 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 3582 transitions. [2022-11-03 03:30:50,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-03 03:30:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 3582 transitions. [2022-11-03 03:30:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-03 03:30:50,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:30:50,713 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 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] [2022-11-03 03:30:50,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 03:30:50,713 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:30:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:30:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -952732932, now seen corresponding path program 1 times [2022-11-03 03:30:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:30:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026071918] [2022-11-03 03:30:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:30:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:30:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 03:31:01,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:01,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026071918] [2022-11-03 03:31:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026071918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:31:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925799796] [2022-11-03 03:31:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:31:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:31:01,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:31:01,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:31:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:02,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 467 conjunts are in the unsatisfiable core [2022-11-03 03:31:02,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:31:03,024 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:31:03,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:31:03,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:31:03,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-11-03 03:31:03,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-11-03 03:31:03,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:31:03,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:03,292 INFO L356 Elim1Store]: treesize reduction 86, result has 11.3 percent of original size [2022-11-03 03:31:03,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: v_arrayElimArr_7 input size 60 context size 60 output size 60 [2022-11-03 03:31:03,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1596598908] [2022-11-03 03:31:03,296 INFO L159 IcfgInterpreter]: Started Sifa with 47 locations of interest [2022-11-03 03:31:03,296 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:31:03,297 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:31:03,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:31:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-11-03 03:31:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017950938] [2022-11-03 03:31:03,299 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:31:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 03:31:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 03:31:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-11-03 03:31:03,300 INFO L87 Difference]: Start difference. First operand 1439 states and 3582 transitions. Second operand has 22 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 03:31:06,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:08,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:10,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:12,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:14,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:16,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:18,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:20,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:22,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:24,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:26,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:28,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:30,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:32,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:34,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:36,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:38,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:40,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:41,519 INFO L93 Difference]: Finished difference Result 2916 states and 7209 transitions. [2022-11-03 03:31:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:31:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2022-11-03 03:31:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:41,538 INFO L225 Difference]: With dead ends: 2916 [2022-11-03 03:31:41,538 INFO L226 Difference]: Without dead ends: 1483 [2022-11-03 03:31:41,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 03:31:41,548 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 96 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 69 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:41,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1185 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1137 Invalid, 15 Unknown, 0 Unchecked, 37.8s Time] [2022-11-03 03:31:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-11-03 03:31:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1469. [2022-11-03 03:31:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1047 states have (on average 1.1298949379178607) internal successors, (1183), 1003 states have internal predecessors, (1183), 135 states have call successors, (135), 65 states have call predecessors, (135), 286 states have return successors, (2299), 400 states have call predecessors, (2299), 105 states have call successors, (2299) [2022-11-03 03:31:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3617 transitions. [2022-11-03 03:31:41,731 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3617 transitions. Word has length 71 [2022-11-03 03:31:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:41,732 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 3617 transitions. [2022-11-03 03:31:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 03:31:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3617 transitions. [2022-11-03 03:31:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-03 03:31:41,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:41,736 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 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] [2022-11-03 03:31:41,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:31:41,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:31:41,951 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:31:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -49840214, now seen corresponding path program 1 times [2022-11-03 03:31:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:41,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415461553] [2022-11-03 03:31:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-03 03:31:42,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415461553] [2022-11-03 03:31:42,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415461553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:42,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:42,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:31:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42204286] [2022-11-03 03:31:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:31:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:31:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:31:42,724 INFO L87 Difference]: Start difference. First operand 1469 states and 3617 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-03 03:31:46,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:48,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:50,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:51,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:53,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:55,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:57,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:31:59,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:00,356 INFO L93 Difference]: Finished difference Result 2981 states and 9405 transitions. [2022-11-03 03:32:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:32:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2022-11-03 03:32:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:00,375 INFO L225 Difference]: With dead ends: 2981 [2022-11-03 03:32:00,376 INFO L226 Difference]: Without dead ends: 1538 [2022-11-03 03:32:00,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:32:00,390 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 3 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:00,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1142 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 17.5s Time] [2022-11-03 03:32:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-03 03:32:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1487. [2022-11-03 03:32:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1059 states have (on average 1.1284230406043436) internal successors, (1195), 1018 states have internal predecessors, (1195), 135 states have call successors, (135), 65 states have call predecessors, (135), 292 states have return successors, (2358), 403 states have call predecessors, (2358), 105 states have call successors, (2358) [2022-11-03 03:32:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 3688 transitions. [2022-11-03 03:32:00,570 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 3688 transitions. Word has length 93 [2022-11-03 03:32:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:00,570 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 3688 transitions. [2022-11-03 03:32:00,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (9), 4 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-03 03:32:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 3688 transitions. [2022-11-03 03:32:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 03:32:00,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:00,577 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:32:00,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:32:00,577 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1098408399, now seen corresponding path program 1 times [2022-11-03 03:32:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221792230] [2022-11-03 03:32:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 03:32:01,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:01,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221792230] [2022-11-03 03:32:01,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221792230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:32:01,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:32:01,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:32:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151459079] [2022-11-03 03:32:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:32:01,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:32:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:01,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:32:01,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:32:01,273 INFO L87 Difference]: Start difference. First operand 1487 states and 3688 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 03:32:04,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:04,517 INFO L93 Difference]: Finished difference Result 2999 states and 9476 transitions. [2022-11-03 03:32:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:32:04,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2022-11-03 03:32:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:04,536 INFO L225 Difference]: With dead ends: 2999 [2022-11-03 03:32:04,537 INFO L226 Difference]: Without dead ends: 1538 [2022-11-03 03:32:04,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:32:04,550 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 4 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:04,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1128 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-03 03:32:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-03 03:32:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1485. [2022-11-03 03:32:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1058 states have (on average 1.1285444234404536) internal successors, (1194), 1016 states have internal predecessors, (1194), 135 states have call successors, (135), 65 states have call predecessors, (135), 291 states have return successors, (2352), 403 states have call predecessors, (2352), 105 states have call successors, (2352) [2022-11-03 03:32:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 3681 transitions. [2022-11-03 03:32:04,750 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 3681 transitions. Word has length 86 [2022-11-03 03:32:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:04,751 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 3681 transitions. [2022-11-03 03:32:04,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 03:32:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 3681 transitions. [2022-11-03 03:32:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-03 03:32:04,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:04,755 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 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] [2022-11-03 03:32:04,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 03:32:04,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1076298338, now seen corresponding path program 1 times [2022-11-03 03:32:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:04,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212160161] [2022-11-03 03:32:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 03:32:07,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:07,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212160161] [2022-11-03 03:32:07,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212160161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:07,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011822978] [2022-11-03 03:32:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:07,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:07,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:32:07,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:32:07,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:32:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:08,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:32:08,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:32:08,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 03:32:08,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-03 03:32:08,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:08,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2022-11-03 03:32:08,966 INFO L356 Elim1Store]: treesize reduction 122, result has 26.9 percent of original size [2022-11-03 03:32:08,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 130 [2022-11-03 03:32:08,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2022-11-03 03:32:08,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-03 03:32:08,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2022-11-03 03:32:09,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-11-03 03:32:09,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:32:09,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 76 [2022-11-03 03:32:09,184 INFO L356 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2022-11-03 03:32:09,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 03:32:09,246 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-11-03 03:32:09,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 80 [2022-11-03 03:32:09,372 INFO L356 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2022-11-03 03:32:09,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 03:32:09,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:09,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-03 03:32:09,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:32:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 03:32:09,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:32:09,720 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-03 03:32:09,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 101 [2022-11-03 03:32:09,759 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-03 03:32:09,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 91 [2022-11-03 03:32:09,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 03:32:09,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 03:32:09,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-11-03 03:32:09,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-11-03 03:32:10,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12733 (Array Int Int)) (|v_system_initialize_~#e~1.base_15| Int)) (let ((.cse0 (store |c_#memory_int| c_~user~0.base (store (select |c_#memory_int| c_~user~0.base) c_~user~0.offset ~sys_state_s~0~AS_START)))) (or (not (= ~sys_state_s~0~AS_IDLE (select (select (store .cse0 |v_system_initialize_~#e~1.base_15| v_ArrVal_12733) c_~user~0.base) c_~user~0.offset))) (not (= (select (select .cse0 |v_system_initialize_~#e~1.base_15|) 0) 0))))) is different from false [2022-11-03 03:32:10,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011822978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:10,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277084399] [2022-11-03 03:32:10,950 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-03 03:32:10,951 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:32:10,951 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:32:10,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:32:10,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2022-11-03 03:32:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392902039] [2022-11-03 03:32:10,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:32:10,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 03:32:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 03:32:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=718, Unknown=1, NotChecked=54, Total=870 [2022-11-03 03:32:10,955 INFO L87 Difference]: Start difference. First operand 1485 states and 3681 transitions. Second operand has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (27), 12 states have call predecessors, (27), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 03:32:15,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:16,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:18,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:21,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:22,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:24,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:26,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:27,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:29,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:31,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:33,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:35,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:38,386 INFO L93 Difference]: Finished difference Result 3244 states and 9820 transitions. [2022-11-03 03:32:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 03:32:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (27), 12 states have call predecessors, (27), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 76 [2022-11-03 03:32:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:38,405 INFO L225 Difference]: With dead ends: 3244 [2022-11-03 03:32:38,406 INFO L226 Difference]: Without dead ends: 1785 [2022-11-03 03:32:38,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=552, Invalid=2991, Unknown=1, NotChecked=116, Total=3660 [2022-11-03 03:32:38,420 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 713 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 2512 mSolverCounterSat, 526 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2512 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:38,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1536 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2512 Invalid, 6 Unknown, 0 Unchecked, 26.5s Time] [2022-11-03 03:32:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-11-03 03:32:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1682. [2022-11-03 03:32:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1199 states have (on average 1.1117597998331943) internal successors, (1333), 1164 states have internal predecessors, (1333), 150 states have call successors, (150), 69 states have call predecessors, (150), 332 states have return successors, (2256), 448 states have call predecessors, (2256), 111 states have call successors, (2256) [2022-11-03 03:32:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 3739 transitions. [2022-11-03 03:32:38,616 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 3739 transitions. Word has length 76 [2022-11-03 03:32:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:38,617 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 3739 transitions. [2022-11-03 03:32:38,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (27), 12 states have call predecessors, (27), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 03:32:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 3739 transitions. [2022-11-03 03:32:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 03:32:38,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:38,622 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 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] [2022-11-03 03:32:38,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:32:38,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:38,835 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1832472035, now seen corresponding path program 1 times [2022-11-03 03:32:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:38,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657966092] [2022-11-03 03:32:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 03:32:40,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657966092] [2022-11-03 03:32:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657966092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:32:40,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:32:40,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:32:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119822136] [2022-11-03 03:32:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:32:40,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:32:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:32:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:32:40,206 INFO L87 Difference]: Start difference. First operand 1682 states and 3739 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 4 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 03:32:43,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:45,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:47,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:49,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:51,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:32:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:51,570 INFO L93 Difference]: Finished difference Result 3351 states and 9517 transitions. [2022-11-03 03:32:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:32:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 4 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2022-11-03 03:32:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:51,590 INFO L225 Difference]: With dead ends: 3351 [2022-11-03 03:32:51,590 INFO L226 Difference]: Without dead ends: 1695 [2022-11-03 03:32:51,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:32:51,603 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 29 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:51,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 661 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 11.3s Time] [2022-11-03 03:32:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-11-03 03:32:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1692. [2022-11-03 03:32:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1206 states have (on average 1.1119402985074627) internal successors, (1341), 1172 states have internal predecessors, (1341), 151 states have call successors, (151), 70 states have call predecessors, (151), 334 states have return successors, (2276), 449 states have call predecessors, (2276), 112 states have call successors, (2276) [2022-11-03 03:32:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 3768 transitions. [2022-11-03 03:32:51,783 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 3768 transitions. Word has length 87 [2022-11-03 03:32:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:51,783 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 3768 transitions. [2022-11-03 03:32:51,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 4 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 03:32:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 3768 transitions. [2022-11-03 03:32:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-03 03:32:51,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:51,792 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:32:51,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 03:32:51,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 838933502, now seen corresponding path program 1 times [2022-11-03 03:32:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705851617] [2022-11-03 03:32:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 51 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-03 03:32:52,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:52,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705851617] [2022-11-03 03:32:52,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705851617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:52,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548552778] [2022-11-03 03:32:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:52,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:32:52,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:32:52,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:32:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:54,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 03:32:54,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:32:54,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 03:32:55,115 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_8| Int) (|ASStop_#Ultimate.C_memset_#ptr#1.offset| Int) (v_ArrVal_15456 Int)) (and (<= (+ c_~user~0.offset 16) |ASStop_#Ultimate.C_memset_#ptr#1.offset|) (<= 0 |v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_8|) (= (store |c_old(#memory_int)| c_~user~0.base (store (select |c_old(#memory_int)| c_~user~0.base) (+ |ASStop_#Ultimate.C_memset_#ptr#1.offset| |v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_8|) v_ArrVal_15456)) |c_#memory_int|))) is different from true [2022-11-03 03:32:55,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:55,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-03 03:32:55,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:32:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 72 trivial. 1 not checked. [2022-11-03 03:32:55,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:32:55,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:32:55,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:55,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:32:55,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:56,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:32:56,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:56,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:32:56,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:56,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ASStop_#Ultimate.C_memset_#ptr#1.offset_52| Int) (v_ArrVal_15506 Int) (|v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_67| Int)) (or (not (<= (+ c_~user~0.offset 16) |v_ASStop_#Ultimate.C_memset_#ptr#1.offset_52|)) (not (= ~sys_state_s~0~AS_IDLE (select (store (select |c_#memory_int| c_~user~0.base) (+ |v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_67| |v_ASStop_#Ultimate.C_memset_#ptr#1.offset_52|) v_ArrVal_15506) c_~user~0.offset))) (not (<= 0 |v_ASStop_#Ultimate.C_memset_#t~loopctr83#1_67|)))) is different from false [2022-11-03 03:32:56,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548552778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:56,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539887489] [2022-11-03 03:32:56,943 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2022-11-03 03:32:56,943 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:32:56,943 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:32:56,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:32:56,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2022-11-03 03:32:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163235964] [2022-11-03 03:32:56,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:32:56,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 03:32:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:56,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 03:32:56,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=157, Unknown=2, NotChecked=50, Total=240 [2022-11-03 03:32:56,945 INFO L87 Difference]: Start difference. First operand 1692 states and 3768 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-03 03:33:00,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:09,037 INFO L93 Difference]: Finished difference Result 3895 states and 11467 transitions. [2022-11-03 03:33:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:33:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 128 [2022-11-03 03:33:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:09,062 INFO L225 Difference]: With dead ends: 3895 [2022-11-03 03:33:09,062 INFO L226 Difference]: Without dead ends: 2226 [2022-11-03 03:33:09,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=141, Invalid=669, Unknown=10, NotChecked=110, Total=930 [2022-11-03 03:33:09,076 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 263 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 179 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:09,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1191 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1085 Invalid, 1 Unknown, 268 Unchecked, 4.4s Time] [2022-11-03 03:33:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2022-11-03 03:33:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2101. [2022-11-03 03:33:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1505 states have (on average 1.1003322259136212) internal successors, (1656), 1465 states have internal predecessors, (1656), 164 states have call successors, (164), 76 states have call predecessors, (164), 431 states have return successors, (3176), 559 states have call predecessors, (3176), 125 states have call successors, (3176) [2022-11-03 03:33:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4996 transitions. [2022-11-03 03:33:09,345 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4996 transitions. Word has length 128 [2022-11-03 03:33:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 4996 transitions. [2022-11-03 03:33:09,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-03 03:33:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4996 transitions. [2022-11-03 03:33:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-03 03:33:09,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:09,355 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 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] [2022-11-03 03:33:09,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:33:09,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:33:09,567 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1367440267, now seen corresponding path program 1 times [2022-11-03 03:33:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:09,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410791525] [2022-11-03 03:33:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 03:33:10,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410791525] [2022-11-03 03:33:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410791525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:10,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:10,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 03:33:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104672756] [2022-11-03 03:33:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:33:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:33:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:33:10,095 INFO L87 Difference]: Start difference. First operand 2101 states and 4996 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (9), 6 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-03 03:33:13,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:13,984 INFO L93 Difference]: Finished difference Result 4291 states and 12991 transitions. [2022-11-03 03:33:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:33:13,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (9), 6 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2022-11-03 03:33:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:14,002 INFO L225 Difference]: With dead ends: 4291 [2022-11-03 03:33:14,002 INFO L226 Difference]: Without dead ends: 2216 [2022-11-03 03:33:14,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:33:14,011 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:14,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1568 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-03 03:33:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-11-03 03:33:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2160. [2022-11-03 03:33:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 1546 states have (on average 1.0976714100905562) internal successors, (1697), 1507 states have internal predecessors, (1697), 164 states have call successors, (164), 76 states have call predecessors, (164), 449 states have return successors, (3245), 576 states have call predecessors, (3245), 125 states have call successors, (3245) [2022-11-03 03:33:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5106 transitions. [2022-11-03 03:33:14,243 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5106 transitions. Word has length 93 [2022-11-03 03:33:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:14,243 INFO L495 AbstractCegarLoop]: Abstraction has 2160 states and 5106 transitions. [2022-11-03 03:33:14,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (9), 6 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-03 03:33:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5106 transitions. [2022-11-03 03:33:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-03 03:33:14,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:14,253 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:33:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 03:33:14,254 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1466586656, now seen corresponding path program 1 times [2022-11-03 03:33:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28143358] [2022-11-03 03:33:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 73 proven. 26 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-03 03:33:15,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28143358] [2022-11-03 03:33:15,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28143358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:33:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167459431] [2022-11-03 03:33:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:33:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:33:15,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:33:15,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:33:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:17,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 2661 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 03:33:17,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:33:17,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:33:17,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:33:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-03 03:33:17,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:33:17,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167459431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:17,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:33:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2022-11-03 03:33:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085793684] [2022-11-03 03:33:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:17,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:33:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:33:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:33:17,394 INFO L87 Difference]: Start difference. First operand 2160 states and 5106 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-03 03:33:19,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:20,278 INFO L93 Difference]: Finished difference Result 4309 states and 13067 transitions. [2022-11-03 03:33:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:33:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 144 [2022-11-03 03:33:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:20,294 INFO L225 Difference]: With dead ends: 4309 [2022-11-03 03:33:20,294 INFO L226 Difference]: Without dead ends: 2169 [2022-11-03 03:33:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:33:20,305 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:20,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 353 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 334 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 03:33:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2022-11-03 03:33:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2154. [2022-11-03 03:33:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1542 states have (on average 1.0972762645914398) internal successors, (1692), 1502 states have internal predecessors, (1692), 164 states have call successors, (164), 76 states have call predecessors, (164), 447 states have return successors, (3243), 575 states have call predecessors, (3243), 125 states have call successors, (3243) [2022-11-03 03:33:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 5099 transitions. [2022-11-03 03:33:20,541 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 5099 transitions. Word has length 144 [2022-11-03 03:33:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:20,541 INFO L495 AbstractCegarLoop]: Abstraction has 2154 states and 5099 transitions. [2022-11-03 03:33:20,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-03 03:33:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 5099 transitions. [2022-11-03 03:33:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-03 03:33:20,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:20,548 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:33:20,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:33:20,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:33:20,769 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1651033749, now seen corresponding path program 1 times [2022-11-03 03:33:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:20,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598814139] [2022-11-03 03:33:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-03 03:33:21,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598814139] [2022-11-03 03:33:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598814139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 03:33:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731539518] [2022-11-03 03:33:21,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:33:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:33:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:33:21,567 INFO L87 Difference]: Start difference. First operand 2154 states and 5099 transitions. Second operand has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-03 03:33:25,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:25,794 INFO L93 Difference]: Finished difference Result 4338 states and 13087 transitions. [2022-11-03 03:33:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:33:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) Word has length 139 [2022-11-03 03:33:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:25,873 INFO L225 Difference]: With dead ends: 4338 [2022-11-03 03:33:25,873 INFO L226 Difference]: Without dead ends: 2210 [2022-11-03 03:33:25,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:33:25,888 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 14 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:25,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1555 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-11-03 03:33:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-11-03 03:33:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2148. [2022-11-03 03:33:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1538 states have (on average 1.0975292587776333) internal successors, (1688), 1498 states have internal predecessors, (1688), 164 states have call successors, (164), 76 states have call predecessors, (164), 445 states have return successors, (3231), 573 states have call predecessors, (3231), 125 states have call successors, (3231) [2022-11-03 03:33:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 5083 transitions. [2022-11-03 03:33:26,104 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 5083 transitions. Word has length 139 [2022-11-03 03:33:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:26,104 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 5083 transitions. [2022-11-03 03:33:26,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.833333333333333) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-03 03:33:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 5083 transitions. [2022-11-03 03:33:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-03 03:33:26,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:26,112 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:33:26,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 03:33:26,112 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1138554675, now seen corresponding path program 1 times [2022-11-03 03:33:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:26,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994457462] [2022-11-03 03:33:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 58 proven. 25 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-03 03:33:27,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994457462] [2022-11-03 03:33:27,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994457462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:33:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892977290] [2022-11-03 03:33:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:27,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:33:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:33:27,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:33:27,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:33:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:29,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 03:33:29,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:33:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-03 03:33:29,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:33:29,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892977290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:29,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:33:29,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2022-11-03 03:33:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770814582] [2022-11-03 03:33:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:29,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:33:29,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:33:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-11-03 03:33:29,675 INFO L87 Difference]: Start difference. First operand 2148 states and 5083 transitions. Second operand has 14 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-03 03:33:34,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:34,614 INFO L93 Difference]: Finished difference Result 4341 states and 13096 transitions. [2022-11-03 03:33:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:33:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) Word has length 138 [2022-11-03 03:33:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:34,642 INFO L225 Difference]: With dead ends: 4341 [2022-11-03 03:33:34,642 INFO L226 Difference]: Without dead ends: 2219 [2022-11-03 03:33:34,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:33:34,660 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:34,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1594 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-11-03 03:33:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2022-11-03 03:33:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2166. [2022-11-03 03:33:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2166 states, 1551 states have (on average 1.0967117988394584) internal successors, (1701), 1511 states have internal predecessors, (1701), 164 states have call successors, (164), 76 states have call predecessors, (164), 450 states have return successors, (3261), 578 states have call predecessors, (3261), 125 states have call successors, (3261) [2022-11-03 03:33:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 5126 transitions. [2022-11-03 03:33:34,989 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 5126 transitions. Word has length 138 [2022-11-03 03:33:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:34,990 INFO L495 AbstractCegarLoop]: Abstraction has 2166 states and 5126 transitions. [2022-11-03 03:33:34,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (11), 6 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-03 03:33:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 5126 transitions. [2022-11-03 03:33:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-03 03:33:35,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:35,001 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:33:35,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-03 03:33:35,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 03:33:35,223 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1141111283, now seen corresponding path program 1 times [2022-11-03 03:33:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:35,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813525029] [2022-11-03 03:33:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-03 03:33:36,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:36,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813525029] [2022-11-03 03:33:36,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813525029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:36,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:36,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 03:33:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743175311] [2022-11-03 03:33:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:36,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:33:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:33:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:33:36,135 INFO L87 Difference]: Start difference. First operand 2166 states and 5126 transitions. Second operand has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-03 03:33:39,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:40,082 INFO L93 Difference]: Finished difference Result 4359 states and 13169 transitions. [2022-11-03 03:33:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 03:33:40,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) Word has length 144 [2022-11-03 03:33:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:40,107 INFO L225 Difference]: With dead ends: 4359 [2022-11-03 03:33:40,107 INFO L226 Difference]: Without dead ends: 2219 [2022-11-03 03:33:40,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:33:40,120 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:40,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1594 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-03 03:33:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2022-11-03 03:33:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2163. [2022-11-03 03:33:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1549 states have (on average 1.0968366688185927) internal successors, (1699), 1509 states have internal predecessors, (1699), 164 states have call successors, (164), 76 states have call predecessors, (164), 449 states have return successors, (3255), 577 states have call predecessors, (3255), 125 states have call successors, (3255) [2022-11-03 03:33:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 5118 transitions. [2022-11-03 03:33:40,338 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 5118 transitions. Word has length 144 [2022-11-03 03:33:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:40,339 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 5118 transitions. [2022-11-03 03:33:40,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.818181818181818) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-03 03:33:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 5118 transitions. [2022-11-03 03:33:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-03 03:33:40,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:40,347 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:33:40,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 03:33:40,347 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1961058987, now seen corresponding path program 1 times [2022-11-03 03:33:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:40,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726541529] [2022-11-03 03:33:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-03 03:33:41,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:41,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726541529] [2022-11-03 03:33:41,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726541529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:41,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:41,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 03:33:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404190977] [2022-11-03 03:33:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:41,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:33:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:33:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:33:41,616 INFO L87 Difference]: Start difference. First operand 2163 states and 5118 transitions. Second operand has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-03 03:33:44,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:45,282 INFO L93 Difference]: Finished difference Result 4462 states and 13398 transitions. [2022-11-03 03:33:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:33:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) Word has length 148 [2022-11-03 03:33:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:45,304 INFO L225 Difference]: With dead ends: 4462 [2022-11-03 03:33:45,304 INFO L226 Difference]: Without dead ends: 2325 [2022-11-03 03:33:45,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:33:45,316 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 5 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:45,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1489 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-11-03 03:33:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-11-03 03:33:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2253. [2022-11-03 03:33:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1614 states have (on average 1.0929368029739777) internal successors, (1764), 1574 states have internal predecessors, (1764), 164 states have call successors, (164), 76 states have call predecessors, (164), 474 states have return successors, (3405), 602 states have call predecessors, (3405), 125 states have call successors, (3405) [2022-11-03 03:33:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5333 transitions. [2022-11-03 03:33:45,561 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5333 transitions. Word has length 148 [2022-11-03 03:33:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:45,561 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 5333 transitions. [2022-11-03 03:33:45,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (13), 6 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-03 03:33:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5333 transitions. [2022-11-03 03:33:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-03 03:33:45,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:45,568 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-11-03 03:33:45,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 03:33:45,569 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:45,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1342883126, now seen corresponding path program 1 times [2022-11-03 03:33:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:45,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708017725] [2022-11-03 03:33:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-03 03:33:46,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:46,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708017725] [2022-11-03 03:33:46,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708017725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:46,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:46,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 03:33:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439486357] [2022-11-03 03:33:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:46,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:33:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:33:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:33:46,667 INFO L87 Difference]: Start difference. First operand 2253 states and 5333 transitions. Second operand has 13 states, 11 states have (on average 5.0) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-03 03:33:50,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:52,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:54,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:56,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:33:58,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:00,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:02,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:04,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:06,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:07,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:09,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:11,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:12,580 INFO L93 Difference]: Finished difference Result 4552 states and 13763 transitions. [2022-11-03 03:34:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:34:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.0) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 1 states have call successors, (10) Word has length 125 [2022-11-03 03:34:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:12,598 INFO L225 Difference]: With dead ends: 4552 [2022-11-03 03:34:12,598 INFO L226 Difference]: Without dead ends: 2325 [2022-11-03 03:34:12,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:34:12,610 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 5 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:12,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1489 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 10 Unknown, 0 Unchecked, 25.7s Time] [2022-11-03 03:34:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2022-11-03 03:34:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2241. [2022-11-03 03:34:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1606 states have (on average 1.0933997509339974) internal successors, (1756), 1566 states have internal predecessors, (1756), 164 states have call successors, (164), 76 states have call predecessors, (164), 470 states have return successors, (3381), 598 states have call predecessors, (3381), 125 states have call successors, (3381) [2022-11-03 03:34:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 5301 transitions. [2022-11-03 03:34:12,809 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 5301 transitions. Word has length 125 [2022-11-03 03:34:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 5301 transitions. [2022-11-03 03:34:12,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.0) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-03 03:34:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 5301 transitions. [2022-11-03 03:34:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 03:34:12,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:12,816 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 3, 3, 2, 2, 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] [2022-11-03 03:34:12,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 03:34:12,816 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1213714756, now seen corresponding path program 1 times [2022-11-03 03:34:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418607396] [2022-11-03 03:34:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:34:14,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:14,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418607396] [2022-11-03 03:34:14,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418607396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:34:14,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:34:14,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:34:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645437679] [2022-11-03 03:34:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:14,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:34:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:34:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:34:14,153 INFO L87 Difference]: Start difference. First operand 2241 states and 5301 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 03:34:17,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:17,517 INFO L93 Difference]: Finished difference Result 4478 states and 13645 transitions. [2022-11-03 03:34:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 03:34:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2022-11-03 03:34:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:17,534 INFO L225 Difference]: With dead ends: 4478 [2022-11-03 03:34:17,534 INFO L226 Difference]: Without dead ends: 2263 [2022-11-03 03:34:17,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:34:17,545 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 31 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:17,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 704 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-11-03 03:34:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2022-11-03 03:34:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2253. [2022-11-03 03:34:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 1616 states have (on average 1.0946782178217822) internal successors, (1769), 1576 states have internal predecessors, (1769), 165 states have call successors, (165), 78 states have call predecessors, (165), 471 states have return successors, (3381), 598 states have call predecessors, (3381), 125 states have call successors, (3381) [2022-11-03 03:34:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 5315 transitions. [2022-11-03 03:34:17,697 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 5315 transitions. Word has length 111 [2022-11-03 03:34:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:17,698 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 5315 transitions. [2022-11-03 03:34:17,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 03:34:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 5315 transitions. [2022-11-03 03:34:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 03:34:17,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:17,705 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 3, 3, 3, 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] [2022-11-03 03:34:17,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 03:34:17,705 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 876684748, now seen corresponding path program 1 times [2022-11-03 03:34:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:17,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185851746] [2022-11-03 03:34:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:34:19,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185851746] [2022-11-03 03:34:19,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185851746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:34:19,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:34:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:34:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79934172] [2022-11-03 03:34:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:34:19,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:34:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:19,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:34:19,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:34:19,263 INFO L87 Difference]: Start difference. First operand 2253 states and 5315 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 03:34:20,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:22,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:24,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:26,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:29,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:30,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:32,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:34,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:35,033 INFO L93 Difference]: Finished difference Result 4586 states and 13823 transitions. [2022-11-03 03:34:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:34:35,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2022-11-03 03:34:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:35,052 INFO L225 Difference]: With dead ends: 4586 [2022-11-03 03:34:35,052 INFO L226 Difference]: Without dead ends: 2353 [2022-11-03 03:34:35,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:34:35,065 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 59 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:35,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 964 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 348 Invalid, 6 Unknown, 0 Unchecked, 15.6s Time] [2022-11-03 03:34:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-11-03 03:34:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2340. [2022-11-03 03:34:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 1675 states have (on average 1.093134328358209) internal successors, (1831), 1639 states have internal predecessors, (1831), 168 states have call successors, (168), 79 states have call predecessors, (168), 496 states have return successors, (3385), 621 states have call predecessors, (3385), 128 states have call successors, (3385) [2022-11-03 03:34:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5384 transitions. [2022-11-03 03:34:35,228 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5384 transitions. Word has length 111 [2022-11-03 03:34:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:35,229 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 5384 transitions. [2022-11-03 03:34:35,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 03:34:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5384 transitions. [2022-11-03 03:34:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-03 03:34:35,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:35,236 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:34:35,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 03:34:35,236 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:35,237 INFO L85 PathProgramCache]: Analyzing trace with hash -684909901, now seen corresponding path program 1 times [2022-11-03 03:34:35,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:35,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863808527] [2022-11-03 03:34:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-03 03:34:36,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863808527] [2022-11-03 03:34:36,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863808527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857825749] [2022-11-03 03:34:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:36,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:36,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:34:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:38,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 03:34:38,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:38,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 03:34:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 03:34:38,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:38,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 03:34:38,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 03:34:39,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 03:34:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-03 03:34:39,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857825749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:34:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957709070] [2022-11-03 03:34:39,060 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-03 03:34:39,060 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:34:39,060 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:34:39,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:34:39,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2022-11-03 03:34:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254005509] [2022-11-03 03:34:39,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:34:39,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:34:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:34:39,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:34:39,064 INFO L87 Difference]: Start difference. First operand 2340 states and 5384 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-03 03:34:41,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:34:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:34:42,705 INFO L93 Difference]: Finished difference Result 4365 states and 12351 transitions. [2022-11-03 03:34:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:34:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-11-03 03:34:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:34:42,729 INFO L225 Difference]: With dead ends: 4365 [2022-11-03 03:34:42,730 INFO L226 Difference]: Without dead ends: 2051 [2022-11-03 03:34:42,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:34:42,746 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 138 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:34:42,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 783 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-03 03:34:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2022-11-03 03:34:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2013. [2022-11-03 03:34:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1438 states have (on average 1.0966620305980528) internal successors, (1577), 1411 states have internal predecessors, (1577), 156 states have call successors, (156), 73 states have call predecessors, (156), 418 states have return successors, (2410), 528 states have call predecessors, (2410), 116 states have call successors, (2410) [2022-11-03 03:34:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4143 transitions. [2022-11-03 03:34:42,933 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4143 transitions. Word has length 115 [2022-11-03 03:34:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:34:42,934 INFO L495 AbstractCegarLoop]: Abstraction has 2013 states and 4143 transitions. [2022-11-03 03:34:42,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-03 03:34:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4143 transitions. [2022-11-03 03:34:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 03:34:42,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:34:42,940 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-03 03:34:42,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:34:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-03 03:34:43,167 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:34:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:34:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash -790287204, now seen corresponding path program 1 times [2022-11-03 03:34:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:34:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682411564] [2022-11-03 03:34:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:34:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 13 proven. 85 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 03:34:48,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:34:48,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682411564] [2022-11-03 03:34:48,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682411564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:48,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137843655] [2022-11-03 03:34:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:34:48,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:34:48,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:34:48,651 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:34:48,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:34:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:34:51,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-03 03:34:51,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:34:51,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:34:51,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:34:51,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:34:51,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:34:51,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-11-03 03:34:51,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-03 03:34:52,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:34:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 79 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 03:34:52,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:34:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137843655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:34:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143252112] [2022-11-03 03:34:53,719 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2022-11-03 03:34:53,719 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:34:53,719 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:34:53,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:34:53,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 18] total 48 [2022-11-03 03:34:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374765386] [2022-11-03 03:34:53,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:34:53,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 03:34:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:34:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 03:34:53,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2881, Unknown=1, NotChecked=0, Total=3080 [2022-11-03 03:34:53,722 INFO L87 Difference]: Start difference. First operand 2013 states and 4143 transitions. Second operand has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 35 states have internal predecessors, (133), 18 states have call successors, (51), 17 states have call predecessors, (51), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-03 03:35:01,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 03:35:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:35:06,784 INFO L93 Difference]: Finished difference Result 5707 states and 13198 transitions. [2022-11-03 03:35:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 03:35:06,785 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 35 states have internal predecessors, (133), 18 states have call successors, (51), 17 states have call predecessors, (51), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 118 [2022-11-03 03:35:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:35:06,811 INFO L225 Difference]: With dead ends: 5707 [2022-11-03 03:35:06,811 INFO L226 Difference]: Without dead ends: 3720 [2022-11-03 03:35:06,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=694, Invalid=6574, Unknown=42, NotChecked=0, Total=7310 [2022-11-03 03:35:06,820 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 481 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 3632 mSolverCounterSat, 324 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 4249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 3632 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:35:06,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2680 Invalid, 4249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 3632 Invalid, 1 Unknown, 292 Unchecked, 10.9s Time] [2022-11-03 03:35:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2022-11-03 03:35:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3620. [2022-11-03 03:35:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 2591 states have (on average 1.1026630644538788) internal successors, (2857), 2568 states have internal predecessors, (2857), 283 states have call successors, (283), 131 states have call predecessors, (283), 745 states have return successors, (4606), 920 states have call predecessors, (4606), 216 states have call successors, (4606) [2022-11-03 03:35:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 7746 transitions. [2022-11-03 03:35:07,065 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 7746 transitions. Word has length 118 [2022-11-03 03:35:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:35:07,066 INFO L495 AbstractCegarLoop]: Abstraction has 3620 states and 7746 transitions. [2022-11-03 03:35:07,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 3.2439024390243905) internal successors, (133), 35 states have internal predecessors, (133), 18 states have call successors, (51), 17 states have call predecessors, (51), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-03 03:35:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 7746 transitions. [2022-11-03 03:35:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 03:35:07,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:35:07,070 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-03 03:35:07,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-03 03:35:07,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:35:07,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:35:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:35:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1616141140, now seen corresponding path program 1 times [2022-11-03 03:35:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:35:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373323829] [2022-11-03 03:35:07,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:35:07,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:35:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 55 proven. 29 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 03:36:18,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:18,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373323829] [2022-11-03 03:36:18,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373323829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:36:18,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313347467] [2022-11-03 03:36:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:36:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:36:18,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:36:18,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a306f563-87f1-4f4c-9cc5-a51725d45151/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:36:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:20,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 391 conjunts are in the unsatisfiable core [2022-11-03 03:36:20,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:36:20,750 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:36:20,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:36:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,913 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-03 03:36:20,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 130 [2022-11-03 03:36:20,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-03 03:36:20,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:36:20,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 03:36:20,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:20,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 16 [2022-11-03 03:36:20,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:36:21,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:21,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:36:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:21,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 03:36:21,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:21,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:21,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-03 03:36:22,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 93 [2022-11-03 03:36:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,286 INFO L356 Elim1Store]: treesize reduction 173, result has 41.8 percent of original size [2022-11-03 03:36:22,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 110 treesize of output 221 [2022-11-03 03:36:22,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2022-11-03 03:36:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,809 INFO L356 Elim1Store]: treesize reduction 64, result has 45.3 percent of original size [2022-11-03 03:36:22,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 123 [2022-11-03 03:36:22,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:36:22,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 87 [2022-11-03 03:36:22,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:22,959 INFO L356 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-03 03:36:22,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 44 [2022-11-03 03:36:22,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:36:22,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:36:23,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:23,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 03:36:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:33,309 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:36:33,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-03 03:36:33,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:33,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:33,565 INFO L356 Elim1Store]: treesize reduction 6, result has 92.2 percent of original size [2022-11-03 03:36:33,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 112 [2022-11-03 03:36:33,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,021 INFO L356 Elim1Store]: treesize reduction 51, result has 29.2 percent of original size [2022-11-03 03:36:34,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 102 [2022-11-03 03:36:34,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2022-11-03 03:36:34,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-11-03 03:36:34,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,460 INFO L356 Elim1Store]: treesize reduction 51, result has 29.2 percent of original size [2022-11-03 03:36:34,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 124 [2022-11-03 03:36:34,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 101 [2022-11-03 03:36:34,527 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:36:34,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 88 [2022-11-03 03:36:34,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2022-11-03 03:36:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,889 INFO L356 Elim1Store]: treesize reduction 6, result has 85.4 percent of original size [2022-11-03 03:36:34,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 78 [2022-11-03 03:36:34,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:36:34,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:36:39,237 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (< c_~user~0.base |c_#StackHeapBarrier|) (= c_~user~0.offset 0) (let ((.cse10 (+ c_~user~0.offset 12))) (let ((.cse6 (select (select |c_old(#memory_$Pointer$.base)| c_~user~0.base) .cse10))) (let ((.cse13 (select |c_old(#memory_int)| .cse6)) (.cse18 (select |c_old(#memory_$Pointer$.base)| .cse6)) (.cse19 (select |c_old(#memory_$Pointer$.offset)| .cse6)) (.cse20 (select (select |c_old(#memory_$Pointer$.offset)| c_~user~0.base) .cse10)) (.cse1 (+ c_~user~0.offset 8)) (.cse15 (select |c_old(#memory_int)| c_~user~0.base))) (or (exists ((v_ArrVal_33714 (Array Int Int)) (v_ArrVal_33782 Int) (v_ArrVal_33790 Int) (v_ArrVal_33745 (Array Int Int)) (v_ArrVal_33708 (Array Int Int)) (v_ArrVal_33809 Int) (v_ArrVal_33839 Int) (v_ArrVal_33818 Int) (v_ArrVal_33807 Int) (message_send_~message~0.offset Int) (v_ArrVal_33788 Int) (v_ArrVal_33753 (Array Int Int)) (v_ArrVal_33706 Int) (v_ArrVal_33813 Int) (v_ArrVal_33769 Int)) (= (let ((.cse0 (let ((.cse14 (+ .cse20 12))) (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| .cse6 (store .cse19 .cse14 v_ArrVal_33788))) (.cse16 (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse18 .cse14 v_ArrVal_33790)))) (let ((.cse3 (select (select .cse16 c_~user~0.base) .cse10)) (.cse12 (+ 16 (select (select .cse17 c_~user~0.base) .cse10)))) (let ((.cse9 (store .cse17 .cse3 (store (select .cse17 .cse3) .cse12 v_ArrVal_33839))) (.cse11 (store .cse16 .cse3 (store (select .cse16 .cse3) .cse12 v_ArrVal_33782)))) (let ((.cse5 (select (select .cse11 c_~user~0.base) .cse10)) (.cse7 (+ (select (select .cse9 c_~user~0.base) .cse10) 20)) (.cse2 (store |c_old(#memory_int)| .cse6 (store .cse13 .cse14 (select .cse15 (+ 20 message_send_~message~0.offset)))))) (let ((.cse4 (store (select .cse2 .cse3) .cse12 (select (select .cse2 c_~user~0.base) (+ 21 message_send_~message~0.offset)))) (.cse8 (select (select (store .cse11 .cse5 (store (select .cse11 .cse5) .cse7 v_ArrVal_33818)) c_~user~0.base) .cse10))) (store (store (store .cse2 .cse3 .cse4) .cse5 (store (select (store (store |c_old(#memory_int)| .cse6 v_ArrVal_33753) .cse3 .cse4) .cse5) .cse7 v_ArrVal_33769)) .cse8 (store (select (store (store (store |c_old(#memory_int)| .cse6 v_ArrVal_33708) .cse3 v_ArrVal_33714) .cse5 (store (select (store (store |c_old(#memory_int)| .cse6 v_ArrVal_33745) .cse3 .cse4) .cse5) .cse7 v_ArrVal_33706)) .cse8) (+ (select (select (store .cse9 .cse5 (store (select .cse9 .cse5) .cse7 v_ArrVal_33813)) c_~user~0.base) .cse10) 24) v_ArrVal_33809)))))))))) (store .cse0 c_~user~0.base (store (select .cse0 c_~user~0.base) .cse1 v_ArrVal_33807))) |c_#memory_int|)) (exists ((v_ArrVal_33804 (Array Int Int)) (v_ArrVal_33716 (Array Int Int)) (v_ArrVal_33807 Int) (v_ArrVal_33830 Int) (message_send_~message~0.offset Int) (v_ArrVal_33811 Int) (v_ArrVal_33755 Int) (v_ArrVal_33805 Int) (v_ArrVal_33758 Int) (v_ArrVal_33703 Int)) (and (= |c_#memory_int| (let ((.cse21 (let ((.cse28 (+ .cse20 28))) (let ((.cse30 (store |c_old(#memory_$Pointer$.offset)| .cse6 (store .cse19 .cse28 v_ArrVal_33811))) (.cse31 (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse18 .cse28 v_ArrVal_33758)))) (let ((.cse23 (select (select .cse31 c_~user~0.base) .cse10)) (.cse27 (+ 32 (select (select .cse30 c_~user~0.base) .cse10)))) (let ((.cse29 (store .cse31 .cse23 (store (select .cse31 .cse23) .cse27 v_ArrVal_33830)))) (let ((.cse25 (select (select .cse29 c_~user~0.base) .cse10)) (.cse26 (+ 36 (select (select (store .cse30 .cse23 (store (select .cse30 .cse23) .cse27 v_ArrVal_33805)) c_~user~0.base) .cse10)))) (store (let ((.cse22 (store |c_old(#memory_int)| .cse6 (store .cse13 .cse28 (select .cse15 (+ 20 message_send_~message~0.offset)))))) (let ((.cse24 (store (select .cse22 .cse23) .cse27 (select (select .cse22 c_~user~0.base) (+ 21 message_send_~message~0.offset))))) (store (store .cse22 .cse23 .cse24) .cse25 (store (select (store (store |c_old(#memory_int)| .cse6 v_ArrVal_33804) .cse23 .cse24) .cse25) .cse26 v_ArrVal_33703)))) (select (select (store .cse29 .cse25 (store (select .cse29 .cse25) .cse26 v_ArrVal_33755)) c_~user~0.base) .cse10) v_ArrVal_33716)))))))) (store .cse21 c_~user~0.base (store (select .cse21 c_~user~0.base) .cse1 v_ArrVal_33807)))) (= ~message_type_s~0~M_OPEN (select .cse15 (+ message_send_~message~0.offset 4))))) (exists ((v_ArrVal_33858 (Array Int Int)) (v_ArrVal_33807 Int) (v_ArrVal_33754 (Array Int Int)) (message_send_~message~0.offset Int) (v_ArrVal_33740 Int) (v_ArrVal_33795 Int) (v_ArrVal_33845 Int) (v_ArrVal_33854 Int) (v_ArrVal_33821 Int) (v_ArrVal_33857 Int)) (and (= |c_#memory_int| (let ((.cse32 (let ((.cse39 (+ 44 .cse20))) (let ((.cse41 (store |c_old(#memory_$Pointer$.offset)| .cse6 (store .cse19 .cse39 v_ArrVal_33857))) (.cse42 (store |c_old(#memory_$Pointer$.base)| .cse6 (store .cse18 .cse39 v_ArrVal_33854)))) (let ((.cse34 (select (select .cse42 c_~user~0.base) .cse10)) (.cse38 (+ (select (select .cse41 c_~user~0.base) .cse10) 48))) (let ((.cse40 (store .cse42 .cse34 (store (select .cse42 .cse34) .cse38 v_ArrVal_33821)))) (let ((.cse36 (select (select .cse40 c_~user~0.base) .cse10)) (.cse37 (+ 52 (select (select (store .cse41 .cse34 (store (select .cse41 .cse34) .cse38 v_ArrVal_33740)) c_~user~0.base) .cse10)))) (store (let ((.cse33 (store |c_old(#memory_int)| .cse6 (store .cse13 .cse39 (select .cse15 (+ 20 message_send_~message~0.offset)))))) (let ((.cse35 (store (select .cse33 .cse34) .cse38 (select (select .cse33 c_~user~0.base) (+ 21 message_send_~message~0.offset))))) (store (store .cse33 .cse34 .cse35) .cse36 (store (select (store (store |c_old(#memory_int)| .cse6 v_ArrVal_33858) .cse34 .cse35) .cse36) .cse37 v_ArrVal_33845)))) (select (select (store .cse40 .cse36 (store (select .cse40 .cse36) .cse37 v_ArrVal_33795)) c_~user~0.base) .cse10) v_ArrVal_33754)))))))) (store .cse32 c_~user~0.base (store (select .cse32 c_~user~0.base) .cse1 v_ArrVal_33807)))) (= (select .cse15 (+ message_send_~message~0.offset 4)) ~message_type_s~0~M_CLOSE))) (and (exists ((v_ArrVal_33807 Int)) (= (store |c_old(#memory_int)| c_~user~0.base (store .cse15 .cse1 v_ArrVal_33807)) |c_#memory_int|)) (exists ((message_send_~message~0.offset Int)) (let ((.cse43 (select .cse15 (+ message_send_~message~0.offset 4)))) (and (not (= ~message_type_s~0~M_OPEN .cse43)) (not (= .cse43 ~message_type_s~0~M_CLOSE))))))))))) is different from false [2022-11-03 03:38:16,038 WARN L234 SmtUtils]: Spent 13.35s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:38:16,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:38:24,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:40:23,552 WARN L234 SmtUtils]: Spent 28.11s on a formula simplification that was a NOOP. DAG size: 254 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:40:24,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370572 treesize of output 277412 [2022-11-03 03:40:27,025 INFO L190 IndexEqualityManager]: detected not equals via solver