./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:21:31,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:21:31,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-09 05:21:31,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:21:31,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:21:31,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:21:31,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:21:31,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:21:31,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:21:31,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:21:31,728 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:21:31,729 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:21:31,729 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:21:31,730 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:21:31,730 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:21:31,731 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:21:31,731 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:21:31,732 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:21:31,732 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:21:31,733 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:21:31,733 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:21:31,738 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:21:31,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:21:31,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:21:31,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:21:31,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:21:31,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:21:31,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:21:31,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:21:31,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:21:31,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:21:31,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:21:31,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:21:31,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:21:31,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:21:31,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:21:31,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:21:31,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:21:31,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:21:31,751 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:21:31,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:21:31,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:21:31,752 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:21:31,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:21:31,754 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe [2024-11-09 05:21:32,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:21:32,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:21:32,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:21:32,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:21:32,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:21:32,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i Unable to find full path for "g++" [2024-11-09 05:21:34,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:21:34,953 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:21:34,954 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i [2024-11-09 05:21:34,994 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/data/019c055eb/efc47542724d405ea6d3ede4a8c522bd/FLAG6816e82ca [2024-11-09 05:21:35,014 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/data/019c055eb/efc47542724d405ea6d3ede4a8c522bd [2024-11-09 05:21:35,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:21:35,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:21:35,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:21:35,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:21:35,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:21:35,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:21:35" (1/1) ... [2024-11-09 05:21:35,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1088a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:35, skipping insertion in model container [2024-11-09 05:21:35,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:21:35" (1/1) ... [2024-11-09 05:21:35,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:21:35,483 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[4493,4506] [2024-11-09 05:21:35,491 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[4553,4566] [2024-11-09 05:21:36,494 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,495 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,496 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,497 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,499 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,519 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,520 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,523 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,524 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,527 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,529 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,530 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:36,531 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,357 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[150674,150687] [2024-11-09 05:21:37,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:21:37,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:21:37,396 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[4493,4506] [2024-11-09 05:21:37,397 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[4553,4566] [2024-11-09 05:21:37,467 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,468 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,468 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,469 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,470 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,484 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,485 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,487 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,488 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,490 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,491 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,492 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,493 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:21:37,631 WARN L250 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_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i[150674,150687] [2024-11-09 05:21:37,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:21:37,903 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:21:37,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37 WrapperNode [2024-11-09 05:21:37,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:21:37,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:21:37,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:21:37,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:21:37,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,112 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 135 [2024-11-09 05:21:38,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:21:38,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:21:38,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:21:38,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:21:38,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:21:38,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:21:38,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:21:38,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:21:38,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (1/1) ... [2024-11-09 05:21:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:21:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:21:38,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:21:38,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:21:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:21:38,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:21:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:21:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-09 05:21:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-09 05:21:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:21:38,280 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-09 05:21:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-09 05:21:38,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:21:38,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:21:38,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:21:38,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:21:38,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:21:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:21:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:21:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:21:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:21:38,283 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-09 05:21:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-09 05:21:38,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:21:38,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:21:38,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:21:38,917 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-09 05:21:38,918 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:21:39,040 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:21:39,040 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:21:39,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:21:39 BoogieIcfgContainer [2024-11-09 05:21:39,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:21:39,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:21:39,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:21:39,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:21:39,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:21:35" (1/3) ... [2024-11-09 05:21:39,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb66c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:21:39, skipping insertion in model container [2024-11-09 05:21:39,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:21:37" (2/3) ... [2024-11-09 05:21:39,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbb66c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:21:39, skipping insertion in model container [2024-11-09 05:21:39,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:21:39" (3/3) ... [2024-11-09 05:21:39,054 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness_negated.i [2024-11-09 05:21:39,074 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:21:39,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:21:39,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:21:39,198 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@f117615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:21:39,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:21:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 05:21:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 05:21:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:39,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:39,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:21:39,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1544382009, now seen corresponding path program 1 times [2024-11-09 05:21:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424994983] [2024-11-09 05:21:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 05:21:40,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:40,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424994983] [2024-11-09 05:21:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424994983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:21:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264890701] [2024-11-09 05:21:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:40,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:21:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:21:40,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:21:40,699 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 05:21:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:40,859 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2024-11-09 05:21:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:21:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 38 [2024-11-09 05:21:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:40,874 INFO L225 Difference]: With dead ends: 84 [2024-11-09 05:21:40,874 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 05:21:40,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:21:40,882 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:40,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 253 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:21:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 05:21:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-09 05:21:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-09 05:21:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-09 05:21:40,944 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 38 [2024-11-09 05:21:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:40,945 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-09 05:21:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 05:21:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-09 05:21:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 05:21:40,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:40,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:40,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:21:40,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:21:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1505122019, now seen corresponding path program 1 times [2024-11-09 05:21:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39174177] [2024-11-09 05:21:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:21:41,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39174177] [2024-11-09 05:21:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39174177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:41,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:21:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847269569] [2024-11-09 05:21:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:21:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:21:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:21:41,351 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 05:21:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:41,569 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2024-11-09 05:21:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:21:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2024-11-09 05:21:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:41,572 INFO L225 Difference]: With dead ends: 100 [2024-11-09 05:21:41,572 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 05:21:41,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:21:41,574 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:41,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 225 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:21:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 05:21:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-09 05:21:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-09 05:21:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2024-11-09 05:21:41,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 40 [2024-11-09 05:21:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:41,598 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2024-11-09 05:21:41,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 05:21:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2024-11-09 05:21:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 05:21:41,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:41,602 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:21:41,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:21:41,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1517081087, now seen corresponding path program 1 times [2024-11-09 05:21:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739347236] [2024-11-09 05:21:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:21:42,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739347236] [2024-11-09 05:21:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739347236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:21:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:21:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512680167] [2024-11-09 05:21:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:21:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:21:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:21:42,009 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 05:21:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:42,287 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2024-11-09 05:21:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:21:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2024-11-09 05:21:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:42,290 INFO L225 Difference]: With dead ends: 107 [2024-11-09 05:21:42,290 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 05:21:42,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:21:42,293 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:42,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:21:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 05:21:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-09 05:21:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-09 05:21:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-11-09 05:21:42,333 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 42 [2024-11-09 05:21:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:42,333 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-11-09 05:21:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 05:21:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-11-09 05:21:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 05:21:42,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:42,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:21:42,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:21:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -645316984, now seen corresponding path program 1 times [2024-11-09 05:21:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707345718] [2024-11-09 05:21:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 05:21:42,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707345718] [2024-11-09 05:21:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707345718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:21:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029982460] [2024-11-09 05:21:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:42,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:21:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:21:42,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:21:42,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:21:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:43,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 05:21:43,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:21:43,281 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 05:21:43,314 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 05:21:43,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2024-11-09 05:21:43,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 05:21:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 05:21:46,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:21:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029982460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:21:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:21:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2024-11-09 05:21:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973905983] [2024-11-09 05:21:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:21:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:21:46,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:21:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:21:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:21:46,952 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 05:21:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:21:47,677 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-11-09 05:21:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:21:47,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 44 [2024-11-09 05:21:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:21:47,679 INFO L225 Difference]: With dead ends: 142 [2024-11-09 05:21:47,680 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 05:21:47,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:21:47,683 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:21:47,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 264 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:21:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 05:21:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-09 05:21:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.263157894736842) internal successors, (72), 60 states have internal predecessors, (72), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2024-11-09 05:21:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-09 05:21:47,727 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 44 [2024-11-09 05:21:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:21:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-09 05:21:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 05:21:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2024-11-09 05:21:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 05:21:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:21:47,733 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:21:47,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:21:47,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:21:47,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:21:47,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:21:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1542922525, now seen corresponding path program 1 times [2024-11-09 05:21:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:21:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267056063] [2024-11-09 05:21:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:21:48,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:21:48,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267056063] [2024-11-09 05:21:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267056063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:21:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784569886] [2024-11-09 05:21:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:21:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:21:48,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:21:48,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:21:48,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:21:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:21:48,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 05:21:48,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:21:48,788 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 05:21:48,810 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 05:21:48,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:48,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:48,968 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-09 05:21:48,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:48,978 INFO L378 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 34 treesize of output 25 [2024-11-09 05:21:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:49,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-09 05:21:49,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:49,017 INFO L378 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 34 treesize of output 25 [2024-11-09 05:21:49,282 INFO L349 Elim1Store]: treesize reduction 58, result has 7.9 percent of original size [2024-11-09 05:21:49,282 INFO L378 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 4 case distinctions, treesize of input 137 treesize of output 124 [2024-11-09 05:21:49,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:21:49,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 105 treesize of output 54 [2024-11-09 05:21:49,337 INFO L378 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 24 treesize of output 23 [2024-11-09 05:23:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 14 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:23:27,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:23:30,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16)) (.cse6 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 8)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_275 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| .cse3)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_275))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_278 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse6) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_278 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0))) (forall ((v_ArrVal_275 Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| .cse3)))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_275))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)))))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_278 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse4) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_275 Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| .cse3)))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_275))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse6) 0)) (or (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (or (forall ((v_ArrVal_278 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))) (forall ((v_ArrVal_275 Int)) (not (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| .cse3)))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_275))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))))))) is different from false [2024-11-09 05:23:31,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:31,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 469 [2024-11-09 05:23:32,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:32,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 352 treesize of output 449 [2024-11-09 05:23:32,413 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:32,566 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:32,648 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:32,742 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:32,822 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:32,919 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-09 05:23:32,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2024-11-09 05:23:34,697 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 05:23:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 280 treesize of output 229 [2024-11-09 05:23:34,893 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 05:23:34,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 137 [2024-11-09 05:23:35,106 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 05:23:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 280 treesize of output 229 [2024-11-09 05:23:35,153 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 05:23:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 26 [2024-11-09 05:23:36,178 INFO L349 Elim1Store]: treesize reduction 187, result has 24.6 percent of original size [2024-11-09 05:23:36,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 536 treesize of output 487 [2024-11-09 05:23:36,456 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 05:23:36,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 137 [2024-11-09 05:23:36,555 INFO L378 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 6 [2024-11-09 05:23:36,569 INFO L378 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 6 [2024-11-09 05:23:36,764 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:23:36,764 INFO L378 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 2 case distinctions, treesize of input 23 treesize of output 6 [2024-11-09 05:23:36,814 INFO L378 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 6 [2024-11-09 05:23:37,044 INFO L378 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 20 treesize of output 18 [2024-11-09 05:23:37,180 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:37,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 40 [2024-11-09 05:23:37,210 INFO L378 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 20 treesize of output 18 [2024-11-09 05:23:37,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:23:37,229 INFO L378 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 2 case distinctions, treesize of input 21 treesize of output 4 [2024-11-09 05:23:37,274 INFO L378 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 20 treesize of output 18 [2024-11-09 05:23:37,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse25 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16)) (.cse5 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_subst_4 Int) (v_DerPreprocessor_70 Int) (v_ArrVal_278 (Array Int Int)) (v_subst_1 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_ArrVal_278) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_10) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_70 (select (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_70) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_99 Int) (v_DerPreprocessor_66 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_6 Int) (v_DerPreprocessor_72 Int) (v_prenex_2 (Array Int Int)) (v_subst_3 Int) (v_DerPreprocessor_103 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse4 (store v_arrayElimArr_11 v_subst_6 v_DerPreprocessor_103))) (let ((.cse8 (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_99)) (.cse9 (store (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_66) v_subst_3 .cse5)) (.cse10 (store (store .cse4 v_subst_2 v_DerPreprocessor_72) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_103 (select (store .cse4 v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6))) (not (= .cse5 (select v_arrayElimArr_7 v_subst_6))) (not (= (select (select (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_7) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (not (= (store (store .cse8 v_subst_1 (select .cse9 v_subst_1)) v_subst_3 .cse5) .cse9)) (not (= v_DerPreprocessor_72 (select .cse10 v_subst_2))) (not (= (select (store .cse8 v_subst_1 .cse5) v_subst_6) v_DerPreprocessor_99)) (not (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_2) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_11) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (not (= v_DerPreprocessor_66 (select .cse9 v_subst_6))) (not (= .cse10 (store (store v_arrayElimArr_11 v_subst_6 (select .cse10 v_subst_6)) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_11 v_subst_6))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_275 Int) (v_DerPreprocessor_93 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (= (select (select (let ((.cse12 (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_6))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_275))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_93 (select (store (store v_arrayElimArr_6 v_subst_5 v_DerPreprocessor_93) v_subst_1 .cse5) v_subst_5))) (not (= .cse5 (select v_arrayElimArr_6 v_subst_5))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_46 Int) (v_DerPreprocessor_66 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_6 Int) (v_prenex_2 (Array Int Int)) (v_DerPreprocessor_101 Int) (v_subst_4 Int) (v_subst_3 Int) (v_DerPreprocessor_97 Int) (v_subst_2 Int)) (let ((.cse14 (store v_arrayElimArr_11 v_subst_6 v_DerPreprocessor_101))) (let ((.cse15 (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_97)) (.cse16 (store (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_66) v_subst_3 .cse5)) (.cse13 (store (store .cse14 v_subst_2 v_DerPreprocessor_46) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= (store (store v_arrayElimArr_11 v_subst_6 (select .cse13 v_subst_6)) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse13)) (not (= (select (store .cse14 v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6) v_DerPreprocessor_101)) (not (= .cse5 (select v_arrayElimArr_7 v_subst_6))) (not (= (select (select (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_7) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (not (= (store (store .cse15 v_subst_2 (select .cse16 v_subst_2)) v_subst_3 .cse5) .cse16)) (not (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_2) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse17 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_11) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (not (= (select (store .cse15 v_subst_2 .cse5) v_subst_6) v_DerPreprocessor_97)) (not (= v_DerPreprocessor_66 (select .cse16 v_subst_6))) (not (= v_DerPreprocessor_46 (select .cse13 v_subst_2))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_11 v_subst_6))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_66 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_6 Int) (v_prenex_2 (Array Int Int)) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_76 Int) (v_DerPreprocessor_95 Int) (v_DerPreprocessor_105 Int)) (let ((.cse19 (store v_arrayElimArr_11 v_subst_6 v_DerPreprocessor_105)) (.cse20 (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_95)) (.cse21 (store (store v_arrayElimArr_7 v_subst_6 v_DerPreprocessor_66) v_subst_3 .cse5))) (or (not (let ((.cse18 (store (store .cse19 v_subst_2 (select (store (store .cse19 v_subst_2 v_DerPreprocessor_76) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2)) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (= (store (store v_arrayElimArr_11 v_subst_6 (select .cse18 v_subst_6)) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse18))) (not (= (store (store .cse20 v_subst_1 (select .cse21 v_subst_1)) v_subst_3 .cse5) .cse21)) (not (= v_DerPreprocessor_105 (select (store .cse19 v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6))) (not (= .cse5 (select v_arrayElimArr_7 v_subst_6))) (not (= (select (select (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_7) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (not (= v_DerPreprocessor_95 (select (store .cse20 v_subst_1 .cse5) v_subst_6))) (= v_subst_4 v_subst_2) (not (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse22 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_2) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse22 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_11) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)) (= v_subst_2 v_subst_1) (not (= v_DerPreprocessor_66 (select .cse21 v_subst_6))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_11 v_subst_6)))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_4) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_8) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)) (not (= (select (select (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_4) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)) (not (= (select v_arrayElimArr_4 v_subst_1) .cse5)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_1))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0) (forall ((v_subst_2 Int) (v_arrayElimArr_9 (Array Int Int))) (or (forall ((v_DerPreprocessor_82 Int) (v_subst_1 Int)) (not (= v_DerPreprocessor_82 (select (store (store v_arrayElimArr_9 v_subst_2 v_DerPreprocessor_82) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2)))) (forall ((v_prenex_6 (Array Int Int))) (= (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|)))) (store (store .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_prenex_6) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_9) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse25) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_9 v_subst_2))))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_5 Int) (v_subst_3 Int)) (or (= (select (select (let ((.cse26 (store .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_16| v_arrayElimArr_5))) (store .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse25) 0) (not (= .cse5 (select v_arrayElimArr_5 v_subst_3))))))))) is different from false [2024-11-09 05:23:38,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:38,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:38,810 INFO L349 Elim1Store]: treesize reduction 90, result has 44.8 percent of original size [2024-11-09 05:23:38,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 250 treesize of output 239 [2024-11-09 05:23:38,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:38,855 INFO L378 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 282 treesize of output 250 [2024-11-09 05:23:38,879 INFO L378 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 138 treesize of output 134 [2024-11-09 05:23:38,905 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:39,246 INFO L349 Elim1Store]: treesize reduction 311, result has 21.3 percent of original size [2024-11-09 05:23:39,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 278 treesize of output 390 [2024-11-09 05:23:39,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:39,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:39,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:39,329 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2024-11-09 05:23:39,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:39,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:39,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:39,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 78 [2024-11-09 05:23:40,339 INFO L349 Elim1Store]: treesize reduction 500, result has 22.7 percent of original size [2024-11-09 05:23:40,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 331 treesize of output 421 [2024-11-09 05:23:42,316 INFO L378 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 [2024-11-09 05:23:42,559 INFO L349 Elim1Store]: treesize reduction 97, result has 7.6 percent of original size [2024-11-09 05:23:42,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 103 treesize of output 84 [2024-11-09 05:23:42,771 INFO L349 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2024-11-09 05:23:42,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 62 [2024-11-09 05:23:42,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 73 [2024-11-09 05:23:42,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:42,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 116 [2024-11-09 05:23:43,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 185 [2024-11-09 05:23:43,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,192 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,198 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 1 [2024-11-09 05:23:43,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2024-11-09 05:23:43,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,237 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2024-11-09 05:23:43,247 INFO L378 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 102 treesize of output 82 [2024-11-09 05:23:43,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 61 [2024-11-09 05:23:43,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-09 05:23:43,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,299 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,301 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:23:43,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2024-11-09 05:23:43,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:23:43,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-09 05:23:43,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,395 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 1 [2024-11-09 05:23:43,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,415 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,416 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 05:23:43,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,426 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,431 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 05:23:43,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,446 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 05:23:43,450 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:23:43,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,455 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:23:43,459 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-09 05:23:43,460 INFO L378 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-09 05:23:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-11-09 05:23:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784569886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:23:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307101835] [2024-11-09 05:23:43,687 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-09 05:23:43,687 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:23:43,692 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:23:43,699 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:23:43,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:23:46,205 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 98 for LOIs [2024-11-09 05:23:46,280 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 16 for LOIs [2024-11-09 05:23:46,283 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 95 for LOIs [2024-11-09 05:23:46,299 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:23:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [307101835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:23:56,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:23:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 18, 9] total 40 [2024-11-09 05:23:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450776287] [2024-11-09 05:23:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:23:56,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:23:56,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:23:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:23:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1219, Unknown=79, NotChecked=146, Total=1560 [2024-11-09 05:23:56,683 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 05:24:01,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:03,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:05,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:07,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:09,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:11,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:13,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:17,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:20,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:22,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:24,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:26,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:28,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:30,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:32,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:34,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:37,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:39,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:41,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:43,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:45,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:47,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:49,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:51,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:54,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:56,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:24:58,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:00,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:02,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:04,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:06,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:08,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:11,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:13,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:15,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:17,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:19,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:21,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:23,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:25,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:27,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:30,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:32,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:34,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:36,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:38,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:40,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:42,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:45,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:47,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:49,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:51,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:53,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:55,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:25:57,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:26:00,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:26:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:00,005 INFO L93 Difference]: Finished difference Result 210 states and 273 transitions. [2024-11-09 05:26:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 05:26:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 46 [2024-11-09 05:26:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:00,192 INFO L225 Difference]: With dead ends: 210 [2024-11-09 05:26:00,192 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 05:26:00,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 105.7s TimeCoverageRelationStatistics Valid=166, Invalid=1654, Unknown=80, NotChecked=170, Total=2070 [2024-11-09 05:26:00,195 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 7 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:00,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 290 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 358 Invalid, 57 Unknown, 0 Unchecked, 119.2s Time] [2024-11-09 05:26:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 05:26:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-11-09 05:26:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 86 states have internal predecessors, (104), 27 states have call successors, (27), 13 states have call predecessors, (27), 15 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-09 05:26:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2024-11-09 05:26:00,235 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 46 [2024-11-09 05:26:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions. [2024-11-09 05:26:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 05:26:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2024-11-09 05:26:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 05:26:00,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:00,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:26:00,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:26:00,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:00,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:26:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1140566772, now seen corresponding path program 1 times [2024-11-09 05:26:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672314764] [2024-11-09 05:26:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:00,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:26:00,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672314764] [2024-11-09 05:26:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672314764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:00,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379698409] [2024-11-09 05:26:00,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:26:00,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:26:00,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:26:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:01,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:26:01,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:26:01,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:26:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379698409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:26:01,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:26:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-09 05:26:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503710737] [2024-11-09 05:26:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:26:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:26:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:26:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:26:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:26:01,200 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 05:26:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:26:01,307 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2024-11-09 05:26:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:26:01,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-11-09 05:26:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:26:01,312 INFO L225 Difference]: With dead ends: 250 [2024-11-09 05:26:01,315 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 05:26:01,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:26:01,317 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:26:01,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:26:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 05:26:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2024-11-09 05:26:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 90 states have internal predecessors, (108), 27 states have call successors, (27), 13 states have call predecessors, (27), 15 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-09 05:26:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2024-11-09 05:26:01,379 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 52 [2024-11-09 05:26:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:26:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2024-11-09 05:26:01,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 05:26:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2024-11-09 05:26:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 05:26:01,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:26:01,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:26:01,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:26:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:01,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:26:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:26:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1904133851, now seen corresponding path program 1 times [2024-11-09 05:26:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:26:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572877712] [2024-11-09 05:26:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:26:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:26:02,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:26:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572877712] [2024-11-09 05:26:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572877712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:26:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420549394] [2024-11-09 05:26:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:26:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:26:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:26:02,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:26:02,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fe85605-3f6f-471d-b4d1-5dd3437cd87a/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:26:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:26:02,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 05:26:02,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:26:02,583 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 05:26:02,604 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 05:26:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,735 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-09 05:26:02,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,745 INFO L378 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 34 treesize of output 25 [2024-11-09 05:26:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-09 05:26:02,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,779 INFO L378 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 27 treesize of output 20 [2024-11-09 05:26:02,961 INFO L349 Elim1Store]: treesize reduction 58, result has 7.9 percent of original size [2024-11-09 05:26:02,962 INFO L378 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 4 case distinctions, treesize of input 137 treesize of output 124 [2024-11-09 05:26:02,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:26:02,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 44 [2024-11-09 05:26:03,001 INFO L378 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 24 treesize of output 23 [2024-11-09 05:27:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 14 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:27:33,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:27:42,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:42,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 469 [2024-11-09 05:27:42,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:27:42,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 352 treesize of output 449 [2024-11-09 05:27:52,161 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-09 05:27:52,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 26 [2024-11-09 05:27:52,599 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-09 05:27:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 50 [2024-11-09 05:27:52,819 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:27:52,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2024-11-09 05:27:53,188 INFO L349 Elim1Store]: treesize reduction 78, result has 16.1 percent of original size [2024-11-09 05:27:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 280 treesize of output 229 [2024-11-09 05:27:53,371 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-09 05:27:53,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 26 [2024-11-09 05:27:53,474 INFO L378 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 689 treesize of output 687 [2024-11-09 05:27:53,961 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:27:53,962 INFO L378 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 2 case distinctions, treesize of input 302 treesize of output 286 [2024-11-09 05:27:54,054 INFO L378 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 473 treesize of output 471 [2024-11-09 05:27:54,242 INFO L378 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 319 treesize of output 308 [2024-11-09 05:27:54,595 INFO L378 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 303 treesize of output 301 [2024-11-09 05:27:54,855 INFO L349 Elim1Store]: treesize reduction 61, result has 25.6 percent of original size [2024-11-09 05:27:54,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2024-11-09 05:27:54,972 INFO L349 Elim1Store]: treesize reduction 61, result has 25.6 percent of original size [2024-11-09 05:27:54,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2024-11-09 05:27:55,029 INFO L378 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 21 treesize of output 4 [2024-11-09 05:28:01,271 WARN L286 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 279 DAG size of output: 140 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:28:01,272 INFO L349 Elim1Store]: treesize reduction 576, result has 33.2 percent of original size [2024-11-09 05:28:01,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 12 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 14 new quantified variables, introduced 57 case distinctions, treesize of input 766 treesize of output 2034 [2024-11-09 05:28:08,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,115 INFO L224 Elim1Store]: Index analysis took 140 ms [2024-11-09 05:28:09,156 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-11-09 05:28:09,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 189 treesize of output 793 [2024-11-09 05:28:09,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,689 INFO L224 Elim1Store]: Index analysis took 119 ms [2024-11-09 05:28:09,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:09,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 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 189 treesize of output 793 [2024-11-09 05:28:10,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:28:10,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,480 INFO L224 Elim1Store]: Index analysis took 190 ms [2024-11-09 05:28:10,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:10,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 793 [2024-11-09 05:28:11,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:11,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:28:12,218 INFO L224 Elim1Store]: Index analysis took 1240 ms [2024-11-09 05:28:13,820 INFO L349 Elim1Store]: treesize reduction 647, result has 3.0 percent of original size [2024-11-09 05:28:13,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 36 case distinctions, treesize of input 291 treesize of output 910 [2024-11-09 05:31:50,986 INFO L224 Elim1Store]: Index analysis took 855 ms