./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 19:44:55,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 19:44:55,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 19:44:55,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 19:44:55,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 19:44:55,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 19:44:55,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 19:44:55,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 19:44:55,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 19:44:55,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 19:44:55,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 19:44:55,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 19:44:55,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 19:44:55,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 19:44:55,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 19:44:55,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 19:44:55,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 19:44:55,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 19:44:55,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 19:44:55,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 19:44:55,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 19:44:55,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 19:44:55,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 19:44:55,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 19:44:55,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 19:44:55,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 19:44:55,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 19:44:55,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 19:44:55,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 19:44:55,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 19:44:55,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 19:44:55,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 19:44:55,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 19:44:55,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 19:44:55,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 19:44:55,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 19:44:55,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 19:44:55,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 19:44:55,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 19:44:55,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 19:44:55,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 19:44:55,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 19:44:55,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 19:44:55,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 19:44:55,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 19:44:55,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 19:44:55,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 19:44:55,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 19:44:55,938 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 19:44:55,938 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 19:44:55,938 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 19:44:55,938 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 19:44:55,939 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 19:44:55,939 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 19:44:55,939 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 19:44:55,939 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 19:44:55,940 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 19:44:55,940 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 19:44:55,940 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 19:44:55,940 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 19:44:55,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 19:44:55,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 19:44:55,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 19:44:55,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 19:44:55,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 19:44:55,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 19:44:55,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 19:44:55,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 19:44:55,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 19:44:55,943 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 19:44:55,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 19:44:55,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 19:44:55,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 19:44:55,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 19:44:55,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:44:55,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 19:44:55,945 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 19:44:55,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 19:44:55,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 19:44:55,946 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 19:44:55,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 19:44:55,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 19:44:55,946 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 19:44:55,947 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_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-11-20 19:44:56,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 19:44:56,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 19:44:56,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 19:44:56,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 19:44:56,279 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 19:44:56,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-20 19:44:59,187 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 19:44:59,447 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 19:44:59,448 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/sv-benchmarks/c/heap-manipulation/dancing.i [2022-11-20 19:44:59,460 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/data/e032e4348/d4f01c486f3c481090239735a4caffb7/FLAG25fd9065b [2022-11-20 19:44:59,474 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/data/e032e4348/d4f01c486f3c481090239735a4caffb7 [2022-11-20 19:44:59,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 19:44:59,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 19:44:59,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 19:44:59,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 19:44:59,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 19:44:59,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:44:59,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d91b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59, skipping insertion in model container [2022-11-20 19:44:59,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:44:59,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 19:44:59,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 19:44:59,691 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-20 19:44:59,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:44:59,881 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 19:44:59,890 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-11-20 19:44:59,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 19:44:59,942 INFO L208 MainTranslator]: Completed translation [2022-11-20 19:44:59,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59 WrapperNode [2022-11-20 19:44:59,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 19:44:59,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 19:44:59,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 19:44:59,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 19:44:59,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:44:59,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:44:59,996 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-11-20 19:44:59,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 19:44:59,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 19:44:59,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 19:44:59,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 19:45:00,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 19:45:00,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 19:45:00,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 19:45:00,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 19:45:00,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (1/1) ... [2022-11-20 19:45:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 19:45:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:45:00,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 19:45:00,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 19:45:00,126 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-11-20 19:45:00,126 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-11-20 19:45:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 19:45:00,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 19:45:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 19:45:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 19:45:00,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 19:45:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 19:45:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 19:45:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 19:45:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 19:45:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 19:45:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 19:45:00,276 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 19:45:00,279 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 19:45:00,533 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 19:45:00,696 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 19:45:00,696 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 19:45:00,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:45:00 BoogieIcfgContainer [2022-11-20 19:45:00,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 19:45:00,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 19:45:00,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 19:45:00,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 19:45:00,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:44:59" (1/3) ... [2022-11-20 19:45:00,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec71692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:45:00, skipping insertion in model container [2022-11-20 19:45:00,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:44:59" (2/3) ... [2022-11-20 19:45:00,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec71692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:45:00, skipping insertion in model container [2022-11-20 19:45:00,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:45:00" (3/3) ... [2022-11-20 19:45:00,707 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-11-20 19:45:00,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 19:45:00,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 19:45:00,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 19:45:00,780 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;@2e43679c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 19:45:00,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 19:45:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 19:45:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 19:45:00,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:00,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:00,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1960236528, now seen corresponding path program 1 times [2022-11-20 19:45:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:00,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734563113] [2022-11-20 19:45:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 19:45:01,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:01,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734563113] [2022-11-20 19:45:01,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734563113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:01,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:01,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:45:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975187658] [2022-11-20 19:45:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:01,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:45:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:01,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:45:01,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:45:01,325 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 19:45:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:01,455 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-11-20 19:45:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:45:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-20 19:45:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:01,468 INFO L225 Difference]: With dead ends: 51 [2022-11-20 19:45:01,471 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 19:45:01,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:45:01,477 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:01,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:45:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 19:45:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 19:45:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 19:45:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-11-20 19:45:01,525 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2022-11-20 19:45:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:01,527 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-11-20 19:45:01,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 19:45:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-11-20 19:45:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 19:45:01,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:01,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:01,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 19:45:01,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -990337553, now seen corresponding path program 1 times [2022-11-20 19:45:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:01,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098276] [2022-11-20 19:45:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:45:01,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098276] [2022-11-20 19:45:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:01,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:01,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 19:45:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883927205] [2022-11-20 19:45:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:01,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 19:45:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 19:45:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 19:45:01,655 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:01,756 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-11-20 19:45:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:45:01,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-11-20 19:45:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:01,765 INFO L225 Difference]: With dead ends: 59 [2022-11-20 19:45:01,765 INFO L226 Difference]: Without dead ends: 40 [2022-11-20 19:45:01,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:45:01,769 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:01,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:45:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-20 19:45:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-11-20 19:45:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 19:45:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-11-20 19:45:01,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 19 [2022-11-20 19:45:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:01,788 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-11-20 19:45:01,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-11-20 19:45:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 19:45:01,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:01,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:01,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 19:45:01,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1915617284, now seen corresponding path program 1 times [2022-11-20 19:45:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:01,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134742908] [2022-11-20 19:45:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 19:45:02,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134742908] [2022-11-20 19:45:02,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134742908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:45:02,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983226637] [2022-11-20 19:45:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:02,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:45:02,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:45:02,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 19:45:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:02,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 19:45:02,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:45:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 19:45:02,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:45:02,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983226637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:02,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:45:02,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2022-11-20 19:45:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439916373] [2022-11-20 19:45:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:02,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:45:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:45:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-20 19:45:02,621 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:03,034 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-11-20 19:45:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 19:45:03,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-20 19:45:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:03,038 INFO L225 Difference]: With dead ends: 78 [2022-11-20 19:45:03,038 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 19:45:03,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-20 19:45:03,040 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:03,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 95 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 19:45:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 19:45:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-11-20 19:45:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (16), 9 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-20 19:45:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2022-11-20 19:45:03,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 21 [2022-11-20 19:45:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:03,053 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2022-11-20 19:45:03,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-11-20 19:45:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 19:45:03,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:03,055 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] [2022-11-20 19:45:03,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 19:45:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:03,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -550540788, now seen corresponding path program 1 times [2022-11-20 19:45:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:03,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314087761] [2022-11-20 19:45:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 19:45:03,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:03,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314087761] [2022-11-20 19:45:03,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314087761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:03,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:03,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:45:03,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165695278] [2022-11-20 19:45:03,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:03,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:45:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:45:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:45:03,537 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:03,718 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-11-20 19:45:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:45:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-20 19:45:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:03,721 INFO L225 Difference]: With dead ends: 75 [2022-11-20 19:45:03,721 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 19:45:03,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:45:03,723 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:03,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 79 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:45:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 19:45:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-11-20 19:45:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-20 19:45:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2022-11-20 19:45:03,740 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 22 [2022-11-20 19:45:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:03,740 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2022-11-20 19:45:03,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 19:45:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2022-11-20 19:45:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 19:45:03,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:03,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:03,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 19:45:03,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash 622387022, now seen corresponding path program 1 times [2022-11-20 19:45:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:03,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070307887] [2022-11-20 19:45:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 19:45:03,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:03,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070307887] [2022-11-20 19:45:03,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070307887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:03,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 19:45:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367369304] [2022-11-20 19:45:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:03,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:45:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:45:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:45:03,905 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:45:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:04,045 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-11-20 19:45:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 19:45:04,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-11-20 19:45:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:04,047 INFO L225 Difference]: With dead ends: 56 [2022-11-20 19:45:04,047 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 19:45:04,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:45:04,048 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:04,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:45:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 19:45:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-11-20 19:45:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-20 19:45:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2022-11-20 19:45:04,064 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2022-11-20 19:45:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:04,064 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2022-11-20 19:45:04,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:45:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2022-11-20 19:45:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 19:45:04,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:04,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:04,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 19:45:04,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1814955922, now seen corresponding path program 1 times [2022-11-20 19:45:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:04,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685329514] [2022-11-20 19:45:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:45:04,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:04,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685329514] [2022-11-20 19:45:04,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685329514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:04,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:04,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 19:45:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621890565] [2022-11-20 19:45:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 19:45:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 19:45:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 19:45:04,349 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 19:45:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:04,545 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2022-11-20 19:45:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:45:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-20 19:45:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:04,547 INFO L225 Difference]: With dead ends: 61 [2022-11-20 19:45:04,548 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 19:45:04,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-20 19:45:04,549 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:04,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 167 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:45:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 19:45:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-20 19:45:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2022-11-20 19:45:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-11-20 19:45:04,561 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 23 [2022-11-20 19:45:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:04,562 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-11-20 19:45:04,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 19:45:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-11-20 19:45:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 19:45:04,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:04,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:04,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 19:45:04,565 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1869846354, now seen corresponding path program 1 times [2022-11-20 19:45:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:04,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172969788] [2022-11-20 19:45:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 19:45:04,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172969788] [2022-11-20 19:45:04,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172969788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:45:04,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:45:04,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 19:45:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369003451] [2022-11-20 19:45:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:45:04,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 19:45:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 19:45:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 19:45:04,708 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:45:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:04,855 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-20 19:45:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 19:45:04,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-11-20 19:45:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:04,857 INFO L225 Difference]: With dead ends: 94 [2022-11-20 19:45:04,857 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 19:45:04,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 19:45:04,858 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:04,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:45:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 19:45:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-20 19:45:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 39 states have internal predecessors, (43), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-20 19:45:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-11-20 19:45:04,874 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 25 [2022-11-20 19:45:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:04,876 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-11-20 19:45:04,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 19:45:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-11-20 19:45:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 19:45:04,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:04,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 19:45:04,883 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -782544633, now seen corresponding path program 1 times [2022-11-20 19:45:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:04,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976720955] [2022-11-20 19:45:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 19:45:05,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:05,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976720955] [2022-11-20 19:45:05,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976720955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:45:05,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289822475] [2022-11-20 19:45:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:05,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:05,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:45:05,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:45:05,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 19:45:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:05,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 19:45:05,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:45:05,397 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-20 19:45:05,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-20 19:45:05,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-20 19:45:05,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 19:45:05,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 25 [2022-11-20 19:45:05,491 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-20 19:45:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:45:05,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:45:05,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:45:05,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 124 treesize of output 127 [2022-11-20 19:45:05,864 INFO L350 Elim1Store]: Elim1 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 136 treesize of output 128 [2022-11-20 19:45:05,870 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 124 [2022-11-20 19:45:05,937 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2022-11-20 19:45:05,953 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 18 [2022-11-20 19:45:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 19:45:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289822475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:45:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298612686] [2022-11-20 19:45:05,993 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 19:45:05,994 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:45:05,998 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-20 19:45:06,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:45:06,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2022-11-20 19:45:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777649557] [2022-11-20 19:45:06,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:45:06,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 19:45:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:45:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 19:45:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-20 19:45:06,003 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 19:45:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:45:06,206 INFO L93 Difference]: Finished difference Result 110 states and 145 transitions. [2022-11-20 19:45:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 19:45:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29 [2022-11-20 19:45:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:45:06,208 INFO L225 Difference]: With dead ends: 110 [2022-11-20 19:45:06,208 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 19:45:06,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-20 19:45:06,210 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:45:06,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 159 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-20 19:45:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 19:45:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-11-20 19:45:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (17), 9 states have call predecessors, (17), 10 states have call successors, (17) [2022-11-20 19:45:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2022-11-20 19:45:06,221 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 29 [2022-11-20 19:45:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:45:06,221 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-11-20 19:45:06,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 19:45:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2022-11-20 19:45:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 19:45:06,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:45:06,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:45:06,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 19:45:06,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:06,429 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:45:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:45:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash 163127043, now seen corresponding path program 1 times [2022-11-20 19:45:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:45:06,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501434495] [2022-11-20 19:45:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:45:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 19:45:06,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:45:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501434495] [2022-11-20 19:45:06,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501434495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:45:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992229307] [2022-11-20 19:45:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:45:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:45:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:45:06,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:45:06,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 19:45:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:45:06,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 19:45:06,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:45:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 19:45:06,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:45:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 19:45:07,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992229307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 19:45:07,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [310014908] [2022-11-20 19:45:07,120 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-20 19:45:07,121 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:45:07,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 19:45:07,126 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 19:45:07,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 19:45:07,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-20 19:45:07,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,193 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-20 19:45:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,222 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 19:45:07,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-20 19:45:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 17 [2022-11-20 19:45:07,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 19:45:07,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,300 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 19:45:07,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-11-20 19:45:07,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-20 19:45:07,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2022-11-20 19:45:07,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2022-11-20 19:45:07,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2022-11-20 19:45:07,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,521 INFO L321 Elim1Store]: treesize reduction 52, result has 36.6 percent of original size [2022-11-20 19:45:07,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2022-11-20 19:45:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,603 INFO L321 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2022-11-20 19:45:07,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 73 [2022-11-20 19:45:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,703 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-20 19:45:07,704 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-11-20 19:45:07,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,722 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 19:45:07,724 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-11-20 19:45:07,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,754 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:45:07,755 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-11-20 19:45:07,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 19:45:07,787 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-20 19:45:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,820 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 19:45:07,820 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-11-20 19:45:07,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,841 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 19:45:07,841 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-11-20 19:45:07,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:07,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:45:07,877 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-20 19:45:07,878 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-11-20 19:45:08,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:08,123 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-11-20 19:45:08,123 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 112 [2022-11-20 19:45:08,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:08,206 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-11-20 19:45:08,206 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 91 [2022-11-20 19:45:08,222 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-20 19:45:08,255 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 1 [2022-11-20 19:45:08,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:08,449 INFO L321 Elim1Store]: treesize reduction 162, result has 45.5 percent of original size [2022-11-20 19:45:08,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 246 treesize of output 300 [2022-11-20 19:45:08,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:45:08,611 INFO L321 Elim1Store]: treesize reduction 104, result has 43.8 percent of original size [2022-11-20 19:45:08,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 361 treesize of output 296 [2022-11-20 19:46:19,779 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-20 19:46:19,780 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 125 treesize of output 85 [2022-11-20 19:46:19,853 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-20 19:46:19,853 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 115 treesize of output 103 [2022-11-20 19:46:19,867 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 1 [2022-11-20 19:46:19,893 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 1 [2022-11-20 19:46:19,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:46:20,118 INFO L321 Elim1Store]: treesize reduction 134, result has 48.3 percent of original size [2022-11-20 19:46:20,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 232 [2022-11-20 19:46:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:46:20,282 INFO L321 Elim1Store]: treesize reduction 102, result has 53.0 percent of original size [2022-11-20 19:46:20,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 243 treesize of output 285 [2022-11-20 19:49:24,912 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2022-11-20 19:49:24,924 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 12 for LOIs [2022-11-20 19:49:24,943 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 19:49:38,890 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 1192 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:49:39,072 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1808#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 19:49:39,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 19:49:39,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 19:49:39,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2022-11-20 19:49:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325333012] [2022-11-20 19:49:39,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 19:49:39,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:49:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:49:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:49:39,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-11-20 19:49:39,075 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 19:49:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:49:39,308 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-11-20 19:49:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:49:39,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-11-20 19:49:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:49:39,310 INFO L225 Difference]: With dead ends: 75 [2022-11-20 19:49:39,310 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 19:49:39,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-11-20 19:49:39,311 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:49:39,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 19:49:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 19:49:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-11-20 19:49:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-20 19:49:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-11-20 19:49:39,318 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 27 [2022-11-20 19:49:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:49:39,318 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-11-20 19:49:39,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 19:49:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-11-20 19:49:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 19:49:39,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:49:39,320 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:49:39,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 19:49:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:49:39,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:49:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:49:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1826310404, now seen corresponding path program 1 times [2022-11-20 19:49:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:49:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46198005] [2022-11-20 19:49:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:49:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 19:49:41,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:49:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46198005] [2022-11-20 19:49:41,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46198005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:49:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951086693] [2022-11-20 19:49:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:49:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:49:41,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:49:41,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 19:49:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:41,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-20 19:49:41,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:49:41,634 INFO L321 Elim1Store]: treesize reduction 16, result has 52.9 percent of original size [2022-11-20 19:49:41,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 61 [2022-11-20 19:49:41,641 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-11-20 19:49:41,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 25 treesize of output 29 [2022-11-20 19:49:41,692 INFO L321 Elim1Store]: treesize reduction 62, result has 32.6 percent of original size [2022-11-20 19:49:41,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 101 [2022-11-20 19:49:41,725 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-11-20 19:49:41,726 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 19:49:41,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 19:49:41,763 INFO L350 Elim1Store]: Elim1 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-20 19:49:41,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:49:41,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-20 19:49:41,846 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 19:49:41,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 91 [2022-11-20 19:49:41,853 INFO L350 Elim1Store]: Elim1 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 91 treesize of output 63 [2022-11-20 19:49:43,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:49:43,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:49:43,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:49:43,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:49:43,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:49:43,344 INFO L321 Elim1Store]: treesize reduction 217, result has 11.1 percent of original size [2022-11-20 19:49:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 75 [2022-11-20 19:49:43,355 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 61 [2022-11-20 19:49:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 19:49:44,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:49:54,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951086693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:49:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1267101481] [2022-11-20 19:49:54,468 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 19:49:54,469 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:49:54,469 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-20 19:49:54,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:49:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2022-11-20 19:49:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989069031] [2022-11-20 19:49:54,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:49:54,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 19:49:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:49:54,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 19:49:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1797, Unknown=3, NotChecked=0, Total=1980 [2022-11-20 19:49:54,481 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 19:49:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:49:56,873 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2022-11-20 19:49:56,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 19:49:56,874 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2022-11-20 19:49:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:49:56,875 INFO L225 Difference]: With dead ends: 99 [2022-11-20 19:49:56,875 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 19:49:56,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=348, Invalid=3555, Unknown=3, NotChecked=0, Total=3906 [2022-11-20 19:49:56,877 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 19:49:56,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 414 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 345 Invalid, 0 Unknown, 174 Unchecked, 0.7s Time] [2022-11-20 19:49:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 19:49:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-20 19:49:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 46 states have internal predecessors, (53), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (23), 10 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-20 19:49:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-11-20 19:49:56,899 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 35 [2022-11-20 19:49:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:49:56,900 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-11-20 19:49:56,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 19:49:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-11-20 19:49:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 19:49:56,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:49:56,905 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] [2022-11-20 19:49:56,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 19:49:57,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 19:49:57,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:49:57,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:49:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1864603018, now seen corresponding path program 1 times [2022-11-20 19:49:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:49:57,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509983998] [2022-11-20 19:49:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:49:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 19:49:57,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:49:57,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509983998] [2022-11-20 19:49:57,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509983998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:49:57,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21391649] [2022-11-20 19:49:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:49:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:49:57,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:49:57,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 19:49:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:57,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 19:49:57,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:49:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 19:49:57,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 19:49:57,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21391649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:49:57,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 19:49:57,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-11-20 19:49:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015835826] [2022-11-20 19:49:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:49:57,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 19:49:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:49:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 19:49:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:49:57,578 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 19:49:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:49:57,764 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2022-11-20 19:49:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 19:49:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-11-20 19:49:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:49:57,766 INFO L225 Difference]: With dead ends: 74 [2022-11-20 19:49:57,766 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 19:49:57,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 19:49:57,767 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:49:57,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:49:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 19:49:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-11-20 19:49:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 46 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (23), 10 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-20 19:49:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-11-20 19:49:57,788 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 34 [2022-11-20 19:49:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:49:57,789 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-20 19:49:57,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 19:49:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2022-11-20 19:49:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 19:49:57,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:49:57,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:49:57,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 19:49:57,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 19:49:57,997 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:49:57,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:49:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash 899636400, now seen corresponding path program 2 times [2022-11-20 19:49:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:49:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265122150] [2022-11-20 19:49:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:49:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 19:49:58,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:49:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265122150] [2022-11-20 19:49:58,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265122150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 19:49:58,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 19:49:58,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 19:49:58,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452940040] [2022-11-20 19:49:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 19:49:58,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 19:49:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:49:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 19:49:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 19:49:58,224 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 19:49:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:49:58,386 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-11-20 19:49:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 19:49:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2022-11-20 19:49:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:49:58,387 INFO L225 Difference]: With dead ends: 75 [2022-11-20 19:49:58,387 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 19:49:58,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 19:49:58,388 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:49:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 19:49:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 19:49:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-11-20 19:49:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 48 states have internal predecessors, (53), 10 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (30), 11 states have call predecessors, (30), 9 states have call successors, (30) [2022-11-20 19:49:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2022-11-20 19:49:58,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 36 [2022-11-20 19:49:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:49:58,401 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2022-11-20 19:49:58,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 19:49:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2022-11-20 19:49:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 19:49:58,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:49:58,402 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:49:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 19:49:58,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:49:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:49:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2043450021, now seen corresponding path program 2 times [2022-11-20 19:49:58,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:49:58,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321049566] [2022-11-20 19:49:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:49:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:49:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:49:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-20 19:49:59,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:49:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321049566] [2022-11-20 19:49:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321049566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:49:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298345769] [2022-11-20 19:49:59,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 19:49:59,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:49:59,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:49:59,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:49:59,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 19:50:00,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 19:50:00,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:50:00,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-20 19:50:00,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:50:00,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 19:50:00,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:00,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-20 19:50:00,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 17 treesize of output 21 [2022-11-20 19:50:00,283 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-20 19:50:00,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:00,291 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-20 19:50:00,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:00,302 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 21 [2022-11-20 19:50:01,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:01,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:01,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:01,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:01,333 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 19:50:01,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-11-20 19:50:01,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:01,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:01,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:01,348 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-20 19:50:01,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 61 [2022-11-20 19:50:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 19:50:02,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:50:02,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:50:02,891 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-20 19:50:03,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (let ((.cse3 (select .cse8 .cse14)) (.cse5 (select .cse7 .cse14))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse9 (= .cse5 0)) (.cse0 (= .cse3 0))) (and (or (not .cse0) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (+ 4 .cse6)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 .cse3)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 .cse5)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (or (not (= .cse6 0)) (not (= .cse1 0)) (and (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0)))))) (not .cse9)) (or (and (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930))) (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_935 (Array Int Int))) (= (select (select (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ 4 .cse12) (select .cse13 .cse14)))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0)) (= 0 .cse12)))))) (forall ((v_ArrVal_935 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_930 (Array Int Int))) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930))) (store .cse15 .cse16 (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|))) (store (select .cse15 .cse16) (+ 4 (select .cse17 |c_ULTIMATE.start_main_~x~0#1.offset|)) (select .cse17 .cse14))))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0)) (= .cse16 0)))) (forall ((v_ArrVal_935 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse18 0) (forall ((v_ArrVal_930 (Array Int Int))) (= (select (select (store .cse19 .cse18 (store (select .cse19 .cse18) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select .cse20 .cse14))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0))))))) (or (forall ((v_ArrVal_930 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_935 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935))) (or (not (= (select (select .cse21 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= (select (select .cse21 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0))))) (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_935 (Array Int Int))) (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935))) (let ((.cse25 (select .cse22 |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ 4 .cse24) (select .cse25 .cse14)))))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0)) (= 0 .cse24)))) (or (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_930))) (or (= (select (select .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse4) 0) (not (= 0 (select (select .cse26 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_935 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_935) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))) (and .cse9 .cse0)))))) is different from false [2022-11-20 19:50:13,429 WARN L233 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 110 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:50:13,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298345769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:50:13,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [108458719] [2022-11-20 19:50:13,435 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 19:50:13,435 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:50:13,435 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-20 19:50:13,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:50:13,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 27 [2022-11-20 19:50:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481358131] [2022-11-20 19:50:13,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:50:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 19:50:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:13,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 19:50:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=864, Unknown=1, NotChecked=60, Total=1056 [2022-11-20 19:50:13,439 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 19:50:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:15,202 INFO L93 Difference]: Finished difference Result 139 states and 197 transitions. [2022-11-20 19:50:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 19:50:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 42 [2022-11-20 19:50:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:15,208 INFO L225 Difference]: With dead ends: 139 [2022-11-20 19:50:15,209 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 19:50:15,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=249, Invalid=1734, Unknown=1, NotChecked=86, Total=2070 [2022-11-20 19:50:15,213 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:15,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 346 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 276 Unchecked, 0.4s Time] [2022-11-20 19:50:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 19:50:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-20 19:50:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 66 states have internal predecessors, (75), 14 states have call successors, (14), 9 states have call predecessors, (14), 13 states have return successors, (40), 14 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-20 19:50:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2022-11-20 19:50:15,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 42 [2022-11-20 19:50:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:15,252 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2022-11-20 19:50:15,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-20 19:50:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2022-11-20 19:50:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 19:50:15,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:15,254 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:50:15,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 19:50:15,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 19:50:15,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1763885732, now seen corresponding path program 3 times [2022-11-20 19:50:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68128777] [2022-11-20 19:50:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-20 19:50:15,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68128777] [2022-11-20 19:50:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68128777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:50:15,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093753343] [2022-11-20 19:50:15,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:50:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:50:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:50:15,693 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:50:15,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 19:50:15,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 19:50:15,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:50:15,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 19:50:15,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:50:16,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 17 treesize of output 21 [2022-11-20 19:50:16,169 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:50:16,170 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 19:50:16,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:16,182 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-20 19:50:16,216 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:50:16,217 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 19:50:16,237 INFO L350 Elim1Store]: Elim1 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-20 19:50:16,260 INFO L350 Elim1Store]: Elim1 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-20 19:50:16,723 INFO L321 Elim1Store]: treesize reduction 98, result has 28.5 percent of original size [2022-11-20 19:50:16,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 134 [2022-11-20 19:50:16,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:16,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:16,829 INFO L321 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2022-11-20 19:50:16,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 74 [2022-11-20 19:50:16,847 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:50:17,070 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 15 [2022-11-20 19:50:17,120 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 15 [2022-11-20 19:50:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:17,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:17,145 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2022-11-20 19:50:17,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:17,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:17,197 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2022-11-20 19:50:17,215 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:17,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:17,290 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 81 [2022-11-20 19:50:17,297 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-20 19:50:17,324 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-20 19:50:22,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:22,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:22,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:22,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:22,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:22,856 INFO L321 Elim1Store]: treesize reduction 975, result has 9.7 percent of original size [2022-11-20 19:50:22,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 5 disjoint index pairs (out of 136 index pairs), introduced 16 new quantified variables, introduced 130 case distinctions, treesize of input 331 treesize of output 350 [2022-11-20 19:50:23,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:23,522 INFO L321 Elim1Store]: treesize reduction 557, result has 21.4 percent of original size [2022-11-20 19:50:23,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 53 case distinctions, treesize of input 1529 treesize of output 1618 [2022-11-20 19:50:24,012 INFO L350 Elim1Store]: Elim1 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 1085 treesize of output 1045 [2022-11-20 19:50:24,415 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-20 19:50:24,418 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:24,497 INFO L350 Elim1Store]: Elim1 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 37 [2022-11-20 19:50:24,587 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-20 19:50:24,589 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:24,939 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 28 [2022-11-20 19:50:25,125 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 50 [2022-11-20 19:50:25,382 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-20 19:50:25,417 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-20 19:50:25,542 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2022-11-20 19:50:25,697 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 47 [2022-11-20 19:50:25,830 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-20 19:50:25,910 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:25,926 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:25,948 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:26,075 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 49 [2022-11-20 19:50:26,207 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-20 19:50:26,297 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:31,020 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:31,559 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:31,817 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:31,979 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:32,499 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:32,751 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:33,043 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:33,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:50:33,299 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2022-11-20 19:50:34,206 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:36,271 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:36,329 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:36,370 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:36,675 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-20 19:50:37,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:37,254 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:37,271 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:37,358 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 31 [2022-11-20 19:50:38,379 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 26 [2022-11-20 19:50:38,487 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:50:38,513 INFO L350 Elim1Store]: Elim1 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 187 treesize of output 173 [2022-11-20 19:50:38,802 INFO L350 Elim1Store]: Elim1 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 226 treesize of output 210 [2022-11-20 19:50:39,065 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 141 [2022-11-20 19:50:39,111 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 102 [2022-11-20 19:50:39,153 INFO L350 Elim1Store]: Elim1 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 9 [2022-11-20 19:50:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 39 refuted. 6 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 19:50:42,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:50:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093753343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:50:43,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848483729] [2022-11-20 19:50:43,388 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 19:50:43,388 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:50:43,388 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-20 19:50:43,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:50:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 25] total 29 [2022-11-20 19:50:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746784369] [2022-11-20 19:50:43,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:50:43,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 19:50:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:50:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 19:50:43,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=759, Unknown=23, NotChecked=0, Total=870 [2022-11-20 19:50:43,391 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-20 19:50:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:50:44,756 INFO L93 Difference]: Finished difference Result 147 states and 206 transitions. [2022-11-20 19:50:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 19:50:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 45 [2022-11-20 19:50:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:50:44,758 INFO L225 Difference]: With dead ends: 147 [2022-11-20 19:50:44,759 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 19:50:44,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=117, Invalid=1045, Unknown=28, NotChecked=0, Total=1190 [2022-11-20 19:50:44,760 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 19:50:44,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 383 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2022-11-20 19:50:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 19:50:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2022-11-20 19:50:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.203125) internal successors, (77), 70 states have internal predecessors, (77), 16 states have call successors, (16), 9 states have call predecessors, (16), 13 states have return successors, (39), 14 states have call predecessors, (39), 15 states have call successors, (39) [2022-11-20 19:50:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2022-11-20 19:50:44,786 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 45 [2022-11-20 19:50:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:50:44,787 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2022-11-20 19:50:44,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-20 19:50:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2022-11-20 19:50:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 19:50:44,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:50:44,789 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] [2022-11-20 19:50:44,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 19:50:44,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 19:50:44,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:50:44,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:50:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1131900261, now seen corresponding path program 1 times [2022-11-20 19:50:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:50:44,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481403195] [2022-11-20 19:50:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:50:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 19:50:48,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:50:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481403195] [2022-11-20 19:50:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481403195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:50:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905871888] [2022-11-20 19:50:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:50:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:50:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:50:48,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:50:48,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 19:50:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:50:48,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-20 19:50:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:50:48,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 17 treesize of output 21 [2022-11-20 19:50:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:50:48,848 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2022-11-20 19:50:48,879 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:50:48,879 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 19:50:48,907 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 19:50:48,908 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 19:50:48,924 INFO L350 Elim1Store]: Elim1 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-20 19:50:48,945 INFO L350 Elim1Store]: Elim1 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-20 19:50:51,497 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_9|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| 4)) 0))) (exists ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_9|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| 4)) 0)))) is different from true [2022-11-20 19:51:01,680 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:51:07,917 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:51:08,475 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:51:08,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:08,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:08,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:08,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:08,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:08,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:08,542 INFO L321 Elim1Store]: treesize reduction 49, result has 22.2 percent of original size [2022-11-20 19:51:08,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 79 [2022-11-20 19:51:08,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:08,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:08,562 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-11-20 19:51:08,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 74 [2022-11-20 19:51:08,594 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:51:10,101 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 19:51:10,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:10,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:10,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:10,167 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 19:51:10,168 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 75 [2022-11-20 19:51:10,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:10,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 69 treesize of output 25 [2022-11-20 19:51:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 19:51:10,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:51:12,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905871888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:51:12,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1252774535] [2022-11-20 19:51:12,059 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-20 19:51:12,060 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:51:12,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-20 19:51:12,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:51:12,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2022-11-20 19:51:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116490223] [2022-11-20 19:51:12,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:51:12,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 19:51:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:51:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 19:51:12,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1555, Unknown=3, NotChecked=80, Total=1806 [2022-11-20 19:51:12,064 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 19:51:21,026 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:51:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:51:25,576 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-11-20 19:51:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 19:51:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) Word has length 41 [2022-11-20 19:51:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:51:25,583 INFO L225 Difference]: With dead ends: 139 [2022-11-20 19:51:25,584 INFO L226 Difference]: Without dead ends: 122 [2022-11-20 19:51:25,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=347, Invalid=3074, Unknown=5, NotChecked=114, Total=3540 [2022-11-20 19:51:25,589 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 19:51:25,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 500 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 448 Invalid, 0 Unknown, 343 Unchecked, 1.2s Time] [2022-11-20 19:51:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-20 19:51:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-20 19:51:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 84 states have internal predecessors, (95), 19 states have call successors, (19), 15 states have call predecessors, (19), 15 states have return successors, (44), 17 states have call predecessors, (44), 18 states have call successors, (44) [2022-11-20 19:51:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2022-11-20 19:51:25,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 41 [2022-11-20 19:51:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:51:25,630 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2022-11-20 19:51:25,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2022-11-20 19:51:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2022-11-20 19:51:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 19:51:25,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:51:25,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:51:25,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 19:51:25,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:51:25,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:51:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:51:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 96045990, now seen corresponding path program 3 times [2022-11-20 19:51:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:51:25,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184514992] [2022-11-20 19:51:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:51:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:51:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:51:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 19:51:28,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:51:28,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184514992] [2022-11-20 19:51:28,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184514992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:51:28,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662807374] [2022-11-20 19:51:28,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 19:51:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:51:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:51:28,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:51:28,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 19:51:28,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 19:51:28,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 19:51:28,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-20 19:51:28,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:51:28,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:28,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:28,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-11-20 19:51:28,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:28,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:28,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-11-20 19:51:28,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:28,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 19:51:28,988 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:51:29,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-20 19:51:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:29,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-20 19:51:29,029 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:51:29,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-20 19:51:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:30,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:30,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:30,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:30,411 INFO L321 Elim1Store]: treesize reduction 169, result has 12.9 percent of original size [2022-11-20 19:51:30,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 95 [2022-11-20 19:51:30,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:30,498 INFO L321 Elim1Store]: treesize reduction 219, result has 11.0 percent of original size [2022-11-20 19:51:30,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 72 [2022-11-20 19:51:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 19:51:36,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:51:37,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662807374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:51:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1870987641] [2022-11-20 19:51:37,049 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 19:51:37,049 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 19:51:37,050 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-20 19:51:37,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 19:51:37,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 39 [2022-11-20 19:51:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830781525] [2022-11-20 19:51:37,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 19:51:37,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 19:51:37,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 19:51:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 19:51:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1417, Unknown=2, NotChecked=0, Total=1560 [2022-11-20 19:51:37,054 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 39 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 19:51:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 19:51:39,307 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2022-11-20 19:51:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 19:51:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 44 [2022-11-20 19:51:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 19:51:39,309 INFO L225 Difference]: With dead ends: 156 [2022-11-20 19:51:39,310 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 19:51:39,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=267, Invalid=2701, Unknown=2, NotChecked=0, Total=2970 [2022-11-20 19:51:39,312 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 19:51:39,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 401 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 248 Invalid, 0 Unknown, 130 Unchecked, 0.7s Time] [2022-11-20 19:51:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 19:51:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-20 19:51:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 78 states have internal predecessors, (88), 18 states have call successors, (18), 14 states have call predecessors, (18), 13 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2022-11-20 19:51:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2022-11-20 19:51:39,342 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 44 [2022-11-20 19:51:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 19:51:39,342 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2022-11-20 19:51:39,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-20 19:51:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2022-11-20 19:51:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 19:51:39,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 19:51:39,344 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 19:51:39,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 19:51:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 19:51:39,550 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 19:51:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 19:51:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 644665369, now seen corresponding path program 4 times [2022-11-20 19:51:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 19:51:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778426911] [2022-11-20 19:51:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 19:51:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 19:51:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:51:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 19:51:42,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 19:51:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778426911] [2022-11-20 19:51:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778426911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 19:51:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549944529] [2022-11-20 19:51:42,489 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 19:51:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 19:51:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 19:51:42,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 19:51:42,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee727301-e401-4354-b25d-c780c7e29256/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 19:51:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 19:51:42,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-20 19:51:42,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 19:51:43,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:43,030 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-11-20 19:51:43,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:43,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:43,043 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 16 [2022-11-20 19:51:43,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 19:51:43,054 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2022-11-20 19:51:43,063 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:51:43,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-20 19:51:43,096 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-20 19:51:44,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 19:51:44,318 INFO L321 Elim1Store]: treesize reduction 48, result has 36.8 percent of original size [2022-11-20 19:51:44,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 53 [2022-11-20 19:51:46,813 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (not (= (select (select |c_#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) 0))) (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (not (= (select (select |c_#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) 0)))) is different from true [2022-11-20 19:51:57,041 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:52:03,273 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 19:52:05,325 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (not (= (select (select |c_#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) 0))) (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (not (= (select (select |c_#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) 0)))) (or (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (let ((.cse0 (+ is_list_containing_x_~l.offset 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| is_list_containing_x_~l.base) .cse0))) (and (= |c_is_list_containing_x_#in~x.base| (select (select |c_#memory_$Pointer$.base| is_list_containing_x_~l.base) .cse0)) (= |c_is_list_containing_x_#in~x.offset| .cse1) (not (= .cse1 0)))))) (exists ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (let ((.cse3 (+ is_list_containing_x_~l.offset 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| is_list_containing_x_~l.base) .cse3))) (and (= |c_is_list_containing_x_#in~x.base| .cse2) (not (= .cse2 0)) (= |c_is_list_containing_x_#in~x.offset| (select (select |c_#memory_$Pointer$.offset| is_list_containing_x_~l.base) .cse3)))))))) is different from true [2022-11-20 19:52:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 23 not checked. [2022-11-20 19:52:05,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 19:52:05,854 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 18 [2022-11-20 19:52:05,859 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2022-11-20 19:52:06,220 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 18 [2022-11-20 19:52:06,225 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2022-11-20 19:52:08,879 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 18 [2022-11-20 19:52:08,883 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2022-11-20 19:52:10,498 INFO L321 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2022-11-20 19:52:10,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 547 treesize of output 412 [2022-11-20 19:52:10,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:52:10,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3597 treesize of output 3533 [2022-11-20 19:52:10,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:52:10,566 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3525 treesize of output 3173 [2022-11-20 19:52:10,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:52:10,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 10462 treesize of output 9175 [2022-11-20 19:52:10,928 INFO L350 Elim1Store]: Elim1 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 9933 treesize of output 9645 [2022-11-20 19:52:11,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 19:52:11,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 9734 treesize of output 9344 [2022-11-20 19:52:11,667 INFO L350 Elim1Store]: Elim1 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 9094 treesize of output 8950 [2022-11-20 19:56:37,160 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 19:56:49,550 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 19:56:49,862 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 19:58:27,164 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 82 [2022-11-20 19:58:27,243 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 56 [2022-11-20 19:58:27,413 INFO L350 Elim1Store]: Elim1 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 6558 treesize of output 6526 [2022-11-20 19:58:40,871 INFO L350 Elim1Store]: Elim1 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 3062 treesize of output 3034 [2022-11-20 19:58:51,252 INFO L350 Elim1Store]: Elim1 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 11072 treesize of output 10780 [2022-11-20 19:59:08,981 INFO L350 Elim1Store]: Elim1 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 4805 treesize of output 4633 [2022-11-20 19:59:24,774 INFO L350 Elim1Store]: Elim1 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 4034 treesize of output 3918