./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5218740bc18d67a03fb6ada79d678262e4837698e28e927d44dbd2d60e2f84aa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:40:15,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:40:15,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:40:15,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:40:15,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:40:15,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:40:15,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:40:15,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:40:15,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:40:15,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:40:15,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:40:15,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:40:15,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:40:15,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:40:15,573 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:40:15,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:40:15,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:40:15,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:40:15,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:40:15,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:40:15,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:40:15,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:40:15,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:40:15,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:40:15,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:40:15,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:40:15,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:40:15,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:40:15,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:40:15,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:40:15,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:40:15,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:40:15,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:40:15,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:40:15,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:40:15,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:40:15,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:40:15,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:40:15,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:40:15,584 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 5218740bc18d67a03fb6ada79d678262e4837698e28e927d44dbd2d60e2f84aa [2024-10-11 14:40:15,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:40:15,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:40:15,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:40:15,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:40:15,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:40:15,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i [2024-10-11 14:40:17,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:40:17,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:40:17,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i [2024-10-11 14:40:17,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1379e88d8/fc5f79ff270840a89dc9e0e733943f4e/FLAG7001d9078 [2024-10-11 14:40:17,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1379e88d8/fc5f79ff270840a89dc9e0e733943f4e [2024-10-11 14:40:17,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:40:17,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:40:17,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:40:17,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:40:17,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:40:17,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211a8f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17, skipping insertion in model container [2024-10-11 14:40:17,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:40:18,116 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i[4500,4513] [2024-10-11 14:40:18,125 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i[4560,4573] [2024-10-11 14:40:18,886 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,886 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,887 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,887 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,890 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,906 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,908 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,911 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,912 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,913 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,915 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,916 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:18,917 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,305 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,311 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:40:19,337 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:40:19,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i[4500,4513] [2024-10-11 14:40:19,350 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_static_harness.i[4560,4573] [2024-10-11 14:40:19,396 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,397 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,397 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,397 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,398 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,406 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,407 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,408 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,408 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,409 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,410 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,410 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,411 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,464 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,470 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:19,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:40:19,698 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:40:19,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19 WrapperNode [2024-10-11 14:40:19,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:40:19,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:40:19,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:40:19,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:40:19,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,845 INFO L138 Inliner]: procedures = 670, calls = 1242, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 162 [2024-10-11 14:40:19,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:40:19,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:40:19,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:40:19,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:40:19,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,902 INFO L175 MemorySlicer]: Split 45 memory accesses to 5 slices as follows [2, 5, 28, 6, 4]. 62 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6, 0, 0]. The 7 writes are split as follows [0, 0, 5, 2, 0]. [2024-10-11 14:40:19,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:40:19,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:40:19,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:40:19,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:40:19,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (1/1) ... [2024-10-11 14:40:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:40:19,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:19,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:40:19,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:40:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:40:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-11 14:40:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:40:20,038 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-11 14:40:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-11 14:40:20,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 14:40:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:40:20,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:40:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-11 14:40:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-11 14:40:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-11 14:40:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-11 14:40:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:40:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:40:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:40:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:40:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:40:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:40:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:40:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-11 14:40:20,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-11 14:40:20,044 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-10-11 14:40:20,044 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:40:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:40:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:40:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:40:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:40:20,299 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:40:20,301 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:40:20,613 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-11 14:40:20,613 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:40:20,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:40:20,647 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:40:20,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:40:20 BoogieIcfgContainer [2024-10-11 14:40:20,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:40:20,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:40:20,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:40:20,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:40:20,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:40:17" (1/3) ... [2024-10-11 14:40:20,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3da613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:40:20, skipping insertion in model container [2024-10-11 14:40:20,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:19" (2/3) ... [2024-10-11 14:40:20,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3da613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:40:20, skipping insertion in model container [2024-10-11 14:40:20,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:40:20" (3/3) ... [2024-10-11 14:40:20,656 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_init_static_harness.i [2024-10-11 14:40:20,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:40:20,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:40:20,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:40:20,729 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=PETRI_NET, 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;@592313bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:40:20,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:40:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 14:40:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 14:40:20,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:20,745 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:40:20,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1736051127, now seen corresponding path program 1 times [2024-10-11 14:40:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677486673] [2024-10-11 14:40:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:40:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:40:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:40:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 14:40:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:40:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:40:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:40:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 14:40:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 14:40:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677486673] [2024-10-11 14:40:21,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677486673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:21,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:40:21,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145268565] [2024-10-11 14:40:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:21,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:40:21,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:40:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:40:21,877 INFO L87 Difference]: Start difference. First operand has 101 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 57 states have internal predecessors, (67), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 14:40:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:22,415 INFO L93 Difference]: Finished difference Result 198 states and 282 transitions. [2024-10-11 14:40:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 91 [2024-10-11 14:40:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:22,426 INFO L225 Difference]: With dead ends: 198 [2024-10-11 14:40:22,427 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 14:40:22,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:40:22,437 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 51 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:22,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 368 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:40:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 14:40:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 14:40:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 33 states have call successors, (33), 10 states have call predecessors, (33), 9 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 14:40:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2024-10-11 14:40:22,493 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 91 [2024-10-11 14:40:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:22,495 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2024-10-11 14:40:22,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 14:40:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2024-10-11 14:40:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:40:22,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:22,499 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 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-10-11 14:40:22,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:40:22,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 772688703, now seen corresponding path program 1 times [2024-10-11 14:40:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389301861] [2024-10-11 14:40:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:22,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:40:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:40:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:40:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 14:40:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:40:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:40:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:40:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 14:40:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-11 14:40:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389301861] [2024-10-11 14:40:25,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389301861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:25,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 14:40:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871836522] [2024-10-11 14:40:25,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 14:40:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 14:40:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:40:25,568 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 7 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 14:40:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:26,871 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2024-10-11 14:40:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 14:40:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 7 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 104 [2024-10-11 14:40:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:26,875 INFO L225 Difference]: With dead ends: 161 [2024-10-11 14:40:26,875 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 14:40:26,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2024-10-11 14:40:26,877 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 43 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:26,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 574 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:40:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 14:40:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-10-11 14:40:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2024-10-11 14:40:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2024-10-11 14:40:26,894 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 104 [2024-10-11 14:40:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2024-10-11 14:40:26,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 7 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 14:40:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2024-10-11 14:40:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 14:40:26,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:26,897 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 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-10-11 14:40:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:40:26,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash -336698855, now seen corresponding path program 1 times [2024-10-11 14:40:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752522951] [2024-10-11 14:40:26,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:40:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501039647] [2024-10-11 14:40:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:27,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:27,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:27,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:27,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:40:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-11 14:40:27,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:27,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:40:27,895 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-10-11 14:40:29,922 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#2| |c_aws_array_list_is_valid_#in~list.base|))) (let ((.cse1 (select (select |c_old(#memory_int#2)| |c_aws_array_list_is_valid_#in~list.base|) (+ |c_aws_array_list_is_valid_#in~list.offset| 16))) (.cse2 (mod (select .cse4 (+ |c_aws_array_list_is_valid_#in~list.offset| 8)) 18446744073709551616)) (.cse0 (= |c_aws_array_list_is_valid_#res| 0))) (or (and .cse0 (exists ((|aws_array_list_is_valid_~#required_size~0.base| Int) (|v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_9| Int) (|v_aws_array_list_is_valid_~#required_size~0.offset_7| Int)) (and (<= |v_aws_array_list_is_valid_~#required_size~0.offset_7| 0) (= (store |c_old(#memory_int#2)| |aws_array_list_is_valid_~#required_size~0.base| (store (select |c_old(#memory_int#2)| |aws_array_list_is_valid_~#required_size~0.base|) |v_aws_array_list_is_valid_~#required_size~0.offset_7| (* .cse1 |v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_9|))) |c_#memory_int#2|) (<= (+ .cse2 1) (mod (select (select |c_#memory_int#2| |aws_array_list_is_valid_~#required_size~0.base|) |v_aws_array_list_is_valid_~#required_size~0.offset_7|) 18446744073709551616))))) (and (exists ((|aws_array_list_is_valid_~#required_size~0.base| Int) (|v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_9| Int) (|v_aws_array_list_is_valid_~#required_size~0.offset_7| Int)) (and (<= |v_aws_array_list_is_valid_~#required_size~0.offset_7| 0) (= (store |c_old(#memory_int#2)| |aws_array_list_is_valid_~#required_size~0.base| (store (select |c_old(#memory_int#2)| |aws_array_list_is_valid_~#required_size~0.base|) |v_aws_array_list_is_valid_~#required_size~0.offset_7| (* .cse1 |v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_9|))) |c_#memory_int#2|) (<= (mod (select (select |c_#memory_int#2| |aws_array_list_is_valid_~#required_size~0.base|) |v_aws_array_list_is_valid_~#required_size~0.offset_7|) 18446744073709551616) .cse2))) (let ((.cse3 (= (mod (select .cse4 (+ |c_aws_array_list_is_valid_#in~list.offset| 24)) 18446744073709551616) 0))) (or (and .cse0 .cse3) (and (not .cse3) (= |c_aws_array_list_is_valid_#res| 1)))))))) is different from true [2024-10-11 14:40:30,145 INFO L349 Elim1Store]: treesize reduction 110, result has 29.9 percent of original size [2024-10-11 14:40:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 174 [2024-10-11 14:40:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-11 14:40:30,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:35,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_aws_array_list_init_static_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_array_list_init_static_~list#1.offset| 8)) (.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_aws_array_list_init_static_~list#1.base|) (+ 16 |c_ULTIMATE.start_aws_array_list_init_static_~list#1.offset|)))) (and (forall ((|v_aws_mul_size_checked_#in~r#1.offset_7| Int)) (or (< 0 |v_aws_mul_size_checked_#in~r#1.offset_7|) (forall ((|v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| Int) (|v_aws_array_list_is_valid_~#required_size~0.base_11| Int)) (let ((.cse3 (* |v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| .cse4))) (let ((.cse0 (select (store |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11| (store (select |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11|) |v_aws_mul_size_checked_#in~r#1.offset_7| .cse3)) |c_ULTIMATE.start_aws_array_list_init_static_~list#1.base|))) (or (not (= (mod (select .cse0 .cse1) 18446744073709551616) 0)) (< (mod (select .cse0 .cse2) 18446744073709551616) (mod .cse3 18446744073709551616)))))))) (forall ((|v_aws_mul_size_checked_#in~r#1.offset_7| Int)) (or (< 0 |v_aws_mul_size_checked_#in~r#1.offset_7|) (forall ((|v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| Int) (|v_aws_array_list_is_valid_~#required_size~0.base_11| Int)) (let ((.cse6 (* |v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| .cse4))) (let ((.cse5 (select (store |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11| (store (select |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11|) |v_aws_mul_size_checked_#in~r#1.offset_7| .cse6)) |c_ULTIMATE.start_aws_array_list_init_static_~list#1.base|))) (or (not (= (mod (select .cse5 .cse1) 18446744073709551616) 0)) (< (mod .cse6 18446744073709551616) (+ (mod (select .cse5 .cse2) 18446744073709551616) 1)))))))) (forall ((|v_aws_mul_size_checked_#in~r#1.offset_7| Int)) (or (forall ((|v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| Int) (|v_aws_array_list_is_valid_~#required_size~0.base_11| Int)) (let ((.cse8 (* |v_aws_mul_size_checked_aws_mul_u64_checked_~b#1_18| .cse4))) (let ((.cse7 (select (store |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11| (store (select |c_#memory_int#2| |v_aws_array_list_is_valid_~#required_size~0.base_11|) |v_aws_mul_size_checked_#in~r#1.offset_7| .cse8)) |c_ULTIMATE.start_aws_array_list_init_static_~list#1.base|))) (or (= (mod (select .cse7 .cse1) 18446744073709551616) 0) (< (mod .cse8 18446744073709551616) (+ (mod (select .cse7 .cse2) 18446744073709551616) 1)))))) (< 0 |v_aws_mul_size_checked_#in~r#1.offset_7|))))) is different from false [2024-10-11 14:40:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752522951] [2024-10-11 14:40:35,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 14:40:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501039647] [2024-10-11 14:40:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501039647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:35,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:40:35,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2024-10-11 14:40:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649683944] [2024-10-11 14:40:35,404 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:35,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 14:40:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 14:40:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=499, Unknown=2, NotChecked=90, Total=650 [2024-10-11 14:40:35,406 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 22 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 8 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 14:40:40,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-11 14:40:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:41,512 INFO L93 Difference]: Finished difference Result 140 states and 186 transitions. [2024-10-11 14:40:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 14:40:41,513 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 8 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 106 [2024-10-11 14:40:41,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:41,515 INFO L225 Difference]: With dead ends: 140 [2024-10-11 14:40:41,515 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 14:40:41,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=97, Invalid=839, Unknown=2, NotChecked=118, Total=1056 [2024-10-11 14:40:41,520 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 66 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:41,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 767 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1499 Invalid, 1 Unknown, 250 Unchecked, 5.9s Time] [2024-10-11 14:40:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 14:40:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 115. [2024-10-11 14:40:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 70 states have internal predecessors, (77), 34 states have call successors, (34), 11 states have call predecessors, (34), 13 states have return successors, (38), 33 states have call predecessors, (38), 32 states have call successors, (38) [2024-10-11 14:40:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2024-10-11 14:40:41,558 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 106 [2024-10-11 14:40:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:41,559 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2024-10-11 14:40:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 8 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2024-10-11 14:40:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2024-10-11 14:40:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 14:40:41,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:41,562 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 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-10-11 14:40:41,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:40:41,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:41,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 343359515, now seen corresponding path program 1 times [2024-10-11 14:40:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793544061] [2024-10-11 14:40:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:40:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:40:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:40:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:40:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 14:40:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:40:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 14:40:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:40:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:40:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 14:40:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:40:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-10-11 14:40:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793544061] [2024-10-11 14:40:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793544061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:42,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:40:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960009344] [2024-10-11 14:40:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:42,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:40:42,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:40:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:40:42,616 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:40:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:42,904 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2024-10-11 14:40:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:40:42,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-11 14:40:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:42,906 INFO L225 Difference]: With dead ends: 202 [2024-10-11 14:40:42,906 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 14:40:42,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:40:42,908 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 27 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:42,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 285 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:40:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 14:40:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-10-11 14:40:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 76 states have internal predecessors, (85), 34 states have call successors, (34), 11 states have call predecessors, (34), 13 states have return successors, (38), 33 states have call predecessors, (38), 32 states have call successors, (38) [2024-10-11 14:40:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 157 transitions. [2024-10-11 14:40:42,933 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 157 transitions. Word has length 106 [2024-10-11 14:40:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:42,934 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 157 transitions. [2024-10-11 14:40:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:40:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2024-10-11 14:40:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 14:40:42,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:42,936 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 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-10-11 14:40:42,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:40:42,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 601524953, now seen corresponding path program 1 times [2024-10-11 14:40:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19543608] [2024-10-11 14:40:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:40:43,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76437959] [2024-10-11 14:40:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:43,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:43,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:43,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:43,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:40:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 142 conjuncts are in the unsatisfiable core [2024-10-11 14:40:43,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:43,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:40:43,930 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-10-11 14:40:43,937 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 19 treesize of output 1 [2024-10-11 14:40:58,538 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 14:41:06,545 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 14:41:18,572 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)