./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:59:14,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:14,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:59:14,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:14,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:14,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:14,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:14,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:14,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:14,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:14,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:14,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:14,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:14,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:14,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:14,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:14,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:14,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:14,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:14,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 -> 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 [2025-03-04 02:59:14,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:14,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:14,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:14,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:14,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:14,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2025-03-04 02:59:15,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465220d08/ab6deff14b1a40a5975c603df9062872/FLAG7d676583b [2025-03-04 02:59:16,310 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:16,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2025-03-04 02:59:16,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465220d08/ab6deff14b1a40a5975c603df9062872/FLAG7d676583b [2025-03-04 02:59:16,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/465220d08/ab6deff14b1a40a5975c603df9062872 [2025-03-04 02:59:16,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:16,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:16,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:16,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:16,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:16,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:16" (1/1) ... [2025-03-04 02:59:16,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d5a6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:16, skipping insertion in model container [2025-03-04 02:59:16,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:16" (1/1) ... [2025-03-04 02:59:16,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:16,726 WARN L250 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_linked_list_rbegin_harness.i[4496,4509] [2025-03-04 02:59:16,733 WARN L250 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_linked_list_rbegin_harness.i[4556,4569] [2025-03-04 02:59:17,176 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,177 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,177 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,178 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,178 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,480 WARN L250 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_linked_list_rbegin_harness.i[150476,150489] [2025-03-04 02:59:17,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:17,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:59:17,505 WARN L250 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_linked_list_rbegin_harness.i[4496,4509] [2025-03-04 02:59:17,505 WARN L250 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_linked_list_rbegin_harness.i[4556,4569] [2025-03-04 02:59:17,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,538 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,538 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,538 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,539 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,543 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:17,621 WARN L250 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_linked_list_rbegin_harness.i[150476,150489] [2025-03-04 02:59:17,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:17,743 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:59:17,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17 WrapperNode [2025-03-04 02:59:17,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:17,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:17,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:59:17,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:59:17,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,810 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-04 02:59:17,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:17,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:59:17,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:59:17,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:59:17,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,835 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-03-04 02:59:17,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:59:17,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:59:17,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:59:17,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:59:17,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (1/1) ... [2025-03-04 02:59:17,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:17,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:59:17,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:59:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:59:17,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:17,900 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:59:17,900 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:59:17,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:59:17,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:59:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:59:17,901 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:59:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:59:18,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:59:18,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:59:18,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:59:18,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:59:18,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:59:18,255 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-04 02:59:18,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:59:18,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:59:18,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:59:18,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:18 BoogieIcfgContainer [2025-03-04 02:59:18,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:59:18,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:59:18,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:59:18,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:59:18,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:16" (1/3) ... [2025-03-04 02:59:18,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f3f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:18, skipping insertion in model container [2025-03-04 02:59:18,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:17" (2/3) ... [2025-03-04 02:59:18,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f3f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:18, skipping insertion in model container [2025-03-04 02:59:18,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:18" (3/3) ... [2025-03-04 02:59:18,272 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2025-03-04 02:59:18,281 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:59:18,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:59:18,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:59:18,331 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;@306d45df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:59:18,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:59:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 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) [2025-03-04 02:59:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:18,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:18,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 02:59:18,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:18,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-03-04 02:59:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6781228] [2025-03-04 02:59:18,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:18,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6781228] [2025-03-04 02:59:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6781228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234146971] [2025-03-04 02:59:18,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:18,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:18,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:59:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:18,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:18,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:18,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:59:18,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:18,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234146971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:18,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:18,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:59:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847357856] [2025-03-04 02:59:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:59:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:18,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:59:18,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:18,817 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 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 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:18,836 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-03-04 02:59:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:59:18,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 02:59:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:18,843 INFO L225 Difference]: With dead ends: 128 [2025-03-04 02:59:18,843 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 02:59:18,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:18,848 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:18,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 02:59:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 02:59:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:59:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-04 02:59:18,875 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-03-04 02:59:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:18,876 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-04 02:59:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-04 02:59:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:18,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:18,879 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 02:59:18,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:59:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:59:19,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-03-04 02:59:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610932044] [2025-03-04 02:59:19,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:19,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:19,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:19,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610932044] [2025-03-04 02:59:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610932044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85873929] [2025-03-04 02:59:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:19,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:19,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:19,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:59:19,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:19,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:19,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:19,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:19,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 02:59:19,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:19,872 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 [2025-03-04 02:59:19,887 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 [2025-03-04 02:59:19,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,951 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 37 treesize of output 32 [2025-03-04 02:59:19,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:19,972 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 41 treesize of output 28 [2025-03-04 02:59:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:59:21,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:21,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85873929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:21,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:21,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 02:59:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265825561] [2025-03-04 02:59:21,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:21,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:59:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:21,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:59:21,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:59:21,042 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:59:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:21,490 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2025-03-04 02:59:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:59:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2025-03-04 02:59:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:21,493 INFO L225 Difference]: With dead ends: 174 [2025-03-04 02:59:21,493 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 02:59:21,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:59:21,494 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 63 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:21,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 362 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:59:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 02:59:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-03-04 02:59:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 02:59:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-03-04 02:59:21,507 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 70 [2025-03-04 02:59:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:21,507 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-03-04 02:59:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:59:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-03-04 02:59:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:21,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:21,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 02:59:21,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:59:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 02:59:21,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:21,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2128292222, now seen corresponding path program 1 times [2025-03-04 02:59:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566948580] [2025-03-04 02:59:21,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:21,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:21,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:21,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:21,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:22,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566948580] [2025-03-04 02:59:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566948580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803158821] [2025-03-04 02:59:22,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:22,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:22,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:22,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:22,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:59:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:22,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:22,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:22,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:22,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:59:22,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:22,196 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 02:59:22,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:59:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:22,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803158821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-03-04 02:59:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110292360] [2025-03-04 02:59:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:22,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:59:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:59:22,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:59:22,697 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:26,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:30,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:34,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:38,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:39,190 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2025-03-04 02:59:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:59:39,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 02:59:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:39,192 INFO L225 Difference]: With dead ends: 196 [2025-03-04 02:59:39,192 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 02:59:39,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:59:39,193 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 76 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:39,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 504 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 329 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2025-03-04 02:59:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 02:59:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2025-03-04 02:59:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 90 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 02:59:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2025-03-04 02:59:39,233 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 162 transitions. Word has length 70 [2025-03-04 02:59:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:39,233 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 162 transitions. [2025-03-04 02:59:39,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2025-03-04 02:59:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:39,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:39,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 02:59:39,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:59:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:39,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 373280483, now seen corresponding path program 1 times [2025-03-04 02:59:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355479430] [2025-03-04 02:59:39,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:39,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:39,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-04 02:59:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355479430] [2025-03-04 02:59:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355479430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59427219] [2025-03-04 02:59:39,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:39,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:39,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:39,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:39,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:59:39,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:39,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:39,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:39,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:39,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 02:59:39,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:39,815 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 24 treesize of output 9 [2025-03-04 02:59:39,828 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 [2025-03-04 02:59:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-04 02:59:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:39,877 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 51 treesize of output 34 [2025-03-04 02:59:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:59:40,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59427219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 02:59:40,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957252763] [2025-03-04 02:59:40,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:40,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:59:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:59:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:59:40,767 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:59:44,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:46,559 INFO L93 Difference]: Finished difference Result 204 states and 279 transitions. [2025-03-04 02:59:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:59:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2025-03-04 02:59:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:46,561 INFO L225 Difference]: With dead ends: 204 [2025-03-04 02:59:46,561 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 02:59:46,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:59:46,562 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 67 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:46,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 535 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 330 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-04 02:59:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 02:59:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-03-04 02:59:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 02:59:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2025-03-04 02:59:46,577 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 70 [2025-03-04 02:59:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:46,578 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2025-03-04 02:59:46,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:59:46,578 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2025-03-04 02:59:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:46,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:46,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 02:59:46,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:59:46,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:46,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:46,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash -797035772, now seen corresponding path program 1 times [2025-03-04 02:59:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580708695] [2025-03-04 02:59:46,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:46,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:46,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:46,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:59:47,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580708695] [2025-03-04 02:59:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580708695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782365275] [2025-03-04 02:59:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:47,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:47,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:59:47,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:47,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:47,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:47,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 02:59:47,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:48,053 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 7 [2025-03-04 02:59:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:50,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782365275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:50,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2025-03-04 02:59:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096255145] [2025-03-04 02:59:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:59:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:50,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:59:50,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:59:50,496 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:59:54,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:59:58,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:02,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:06,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:10,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:14,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:16,070 INFO L93 Difference]: Finished difference Result 210 states and 283 transitions. [2025-03-04 03:00:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 03:00:16,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-04 03:00:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:16,072 INFO L225 Difference]: With dead ends: 210 [2025-03-04 03:00:16,072 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 03:00:16,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-04 03:00:16,074 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 229 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 59 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:16,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 519 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 314 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2025-03-04 03:00:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 03:00:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-03-04 03:00:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.288888888888889) internal successors, (116), 92 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 03:00:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2025-03-04 03:00:16,085 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 70 [2025-03-04 03:00:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:16,085 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2025-03-04 03:00:16,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2025-03-04 03:00:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:16,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:16,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 03:00:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:16,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:16,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1520781725, now seen corresponding path program 1 times [2025-03-04 03:00:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396780313] [2025-03-04 03:00:16,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:16,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:16,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396780313] [2025-03-04 03:00:16,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396780313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:16,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801847894] [2025-03-04 03:00:16,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:16,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:16,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 03:00:16,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:16,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:16,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:16,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:16,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:16,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 03:00:16,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801847894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:16,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:16,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 03:00:16,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627491716] [2025-03-04 03:00:16,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:16,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:16,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:16,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:16,610 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:16,656 INFO L93 Difference]: Finished difference Result 234 states and 314 transitions. [2025-03-04 03:00:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 03:00:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:16,659 INFO L225 Difference]: With dead ends: 234 [2025-03-04 03:00:16,659 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 03:00:16,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:16,660 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:16,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 03:00:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 03:00:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 92 states have internal predecessors, (115), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 03:00:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 161 transitions. [2025-03-04 03:00:16,670 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 161 transitions. Word has length 70 [2025-03-04 03:00:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:16,670 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 161 transitions. [2025-03-04 03:00:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2025-03-04 03:00:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:16,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:16,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 03:00:16,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 03:00:16,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:16,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1603869316, now seen corresponding path program 1 times [2025-03-04 03:00:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906542704] [2025-03-04 03:00:16,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:16,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:16,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:16,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906542704] [2025-03-04 03:00:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906542704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883268289] [2025-03-04 03:00:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:16,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:16,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 03:00:17,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:17,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:17,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:17,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 03:00:17,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883268289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:17,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:17,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 03:00:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573086893] [2025-03-04 03:00:17,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:17,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:17,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:17,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:17,149 INFO L87 Difference]: Start difference. First operand 124 states and 161 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:17,208 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2025-03-04 03:00:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 03:00:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:17,210 INFO L225 Difference]: With dead ends: 236 [2025-03-04 03:00:17,210 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 03:00:17,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:17,211 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:17,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 03:00:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-04 03:00:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 94 states have internal predecessors, (116), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 03:00:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 162 transitions. [2025-03-04 03:00:17,243 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 162 transitions. Word has length 70 [2025-03-04 03:00:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:17,243 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 162 transitions. [2025-03-04 03:00:17,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 162 transitions. [2025-03-04 03:00:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:17,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:17,244 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-03-04 03:00:17,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:17,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:17,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:17,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash -189525275, now seen corresponding path program 1 times [2025-03-04 03:00:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:17,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039140158] [2025-03-04 03:00:17,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:17,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:17,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039140158] [2025-03-04 03:00:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039140158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595825510] [2025-03-04 03:00:17,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:17,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:17,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:17,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:17,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 03:00:17,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:17,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:17,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 03:00:17,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:17,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595825510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:17,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 03:00:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815268862] [2025-03-04 03:00:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:00:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:17,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:00:17,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:17,838 INFO L87 Difference]: Start difference. First operand 126 states and 162 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:18,049 INFO L93 Difference]: Finished difference Result 262 states and 347 transitions. [2025-03-04 03:00:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:00:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 03:00:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:18,051 INFO L225 Difference]: With dead ends: 262 [2025-03-04 03:00:18,051 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 03:00:18,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 03:00:18,052 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 94 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:18,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 273 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:00:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 03:00:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 03:00:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 117 states have internal predecessors, (147), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-04 03:00:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2025-03-04 03:00:18,066 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 70 [2025-03-04 03:00:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:18,066 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2025-03-04 03:00:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2025-03-04 03:00:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:00:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:18,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:18,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 03:00:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 03:00:18,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1002041002, now seen corresponding path program 1 times [2025-03-04 03:00:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646468377] [2025-03-04 03:00:18,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:18,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:18,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:18,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:18,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 03:00:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646468377] [2025-03-04 03:00:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646468377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371117306] [2025-03-04 03:00:18,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:18,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:18,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 03:00:18,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:18,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:18,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:18,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:18,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 03:00:18,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:18,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371117306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 03:00:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98550211] [2025-03-04 03:00:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:18,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:18,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:18,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:00:18,747 INFO L87 Difference]: Start difference. First operand 151 states and 201 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:19,062 INFO L93 Difference]: Finished difference Result 313 states and 421 transitions. [2025-03-04 03:00:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-04 03:00:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:19,063 INFO L225 Difference]: With dead ends: 313 [2025-03-04 03:00:19,063 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 03:00:19,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:19,064 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:19,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 254 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:00:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 03:00:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2025-03-04 03:00:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 117 states have internal predecessors, (147), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-04 03:00:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 201 transitions. [2025-03-04 03:00:19,081 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 201 transitions. Word has length 71 [2025-03-04 03:00:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:19,081 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 201 transitions. [2025-03-04 03:00:19,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 201 transitions. [2025-03-04 03:00:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:00:19,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:19,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-03-04 03:00:19,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 03:00:19,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:19,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:19,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2011864026, now seen corresponding path program 1 times [2025-03-04 03:00:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:19,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912024473] [2025-03-04 03:00:19,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:19,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:19,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:19,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 03:00:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912024473] [2025-03-04 03:00:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912024473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209397357] [2025-03-04 03:00:19,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:19,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:19,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:19,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 03:00:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:19,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:19,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:19,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:19,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 03:00:19,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:19,757 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 [2025-03-04 03:00:19,783 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 [2025-03-04 03:00:19,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,863 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 [2025-03-04 03:00:19,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,876 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 [2025-03-04 03:00:19,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 03:00:19,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:19,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 03:00:20,047 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-04 03:00:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 127 [2025-03-04 03:00:20,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2025-03-04 03:00:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-04 03:00:20,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:20,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 03:00:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:33,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:33,882 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_705 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_705))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_708))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |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_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-04 03:00:33,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 1)) (forall ((v_ArrVal_708 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_ArrVal_708))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 1)) (forall ((v_ArrVal_705 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.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)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_ArrVal_705))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-04 03:00:33,944 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:33,946 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:34,078 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:34,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2025-03-04 03:00:34,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:34,108 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 238 treesize of output 234 [2025-03-04 03:00:34,125 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 187 treesize of output 175 [2025-03-04 03:00:34,147 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:34,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:34,381 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:34,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 360 [2025-03-04 03:00:34,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:34,428 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 358 treesize of output 330 [2025-03-04 03:00:34,448 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 289 treesize of output 277 [2025-03-04 03:00:34,534 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 [2025-03-04 03:00:34,610 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 [2025-03-04 03:00:35,595 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:35,596 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:35,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:35,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 120 [2025-03-04 03:00:35,749 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:35,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:35,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:35,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 [2025-03-04 03:00:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-04 03:00:35,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209397357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:35,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:35,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-03-04 03:00:35,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87288718] [2025-03-04 03:00:35,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 03:00:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:35,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 03:00:35,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=286, Unknown=11, NotChecked=70, Total=420 [2025-03-04 03:00:35,986 INFO L87 Difference]: Start difference. First operand 151 states and 201 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 03:00:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:47,355 INFO L93 Difference]: Finished difference Result 373 states and 519 transitions. [2025-03-04 03:00:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 03:00:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 71 [2025-03-04 03:00:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:47,360 INFO L225 Difference]: With dead ends: 373 [2025-03-04 03:00:47,360 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 03:00:47,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=137, Invalid=788, Unknown=13, NotChecked=118, Total=1056 [2025-03-04 03:00:47,361 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 74 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 4 mSolverCounterUnsat, 95 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 95 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:47,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1070 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 701 Invalid, 95 Unknown, 315 Unchecked, 2.1s Time] [2025-03-04 03:00:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 03:00:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 207. [2025-03-04 03:00:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.2941176470588236) internal successors, (198), 162 states have internal predecessors, (198), 36 states have call successors, (36), 11 states have call predecessors, (36), 17 states have return successors, (52), 33 states have call predecessors, (52), 34 states have call successors, (52) [2025-03-04 03:00:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 286 transitions. [2025-03-04 03:00:47,378 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 286 transitions. Word has length 71 [2025-03-04 03:00:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:47,379 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 286 transitions. [2025-03-04 03:00:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 19 states have internal predecessors, (82), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-04 03:00:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 286 transitions. [2025-03-04 03:00:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 03:00:47,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:47,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:47,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 03:00:47,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1501802700, now seen corresponding path program 1 times [2025-03-04 03:00:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621311590] [2025-03-04 03:00:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 03:00:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 03:00:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:00:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621311590] [2025-03-04 03:00:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621311590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:47,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569998994] [2025-03-04 03:00:47,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:47,754 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:47,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 03:00:47,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 03:00:47,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 03:00:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:47,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 03:00:47,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:48,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569998994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:48,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-04 03:00:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432862825] [2025-03-04 03:00:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:48,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:48,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:48,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:00:48,090 INFO L87 Difference]: Start difference. First operand 207 states and 286 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:48,454 INFO L93 Difference]: Finished difference Result 376 states and 512 transitions. [2025-03-04 03:00:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:00:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-03-04 03:00:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:48,456 INFO L225 Difference]: With dead ends: 376 [2025-03-04 03:00:48,456 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 03:00:48,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 03:00:48,457 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 94 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:48,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 303 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:00:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 03:00:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2025-03-04 03:00:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.2679738562091503) internal successors, (194), 162 states have internal predecessors, (194), 36 states have call successors, (36), 11 states have call predecessors, (36), 17 states have return successors, (52), 33 states have call predecessors, (52), 34 states have call successors, (52) [2025-03-04 03:00:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 282 transitions. [2025-03-04 03:00:48,475 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 282 transitions. Word has length 72 [2025-03-04 03:00:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 282 transitions. [2025-03-04 03:00:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 282 transitions. [2025-03-04 03:00:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 03:00:48,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:48,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:48,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 03:00:48,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1729986996, now seen corresponding path program 1 times [2025-03-04 03:00:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106511275] [2025-03-04 03:00:48,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 03:00:48,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 03:00:48,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:48,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:00:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106511275] [2025-03-04 03:00:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106511275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460166900] [2025-03-04 03:00:48,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:48,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:48,861 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:48,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 03:00:48,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 03:00:48,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 03:00:48,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:48,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:48,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 03:00:48,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:49,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460166900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:49,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:49,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-04 03:00:49,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440008110] [2025-03-04 03:00:49,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:49,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:00:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:49,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:00:49,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:49,204 INFO L87 Difference]: Start difference. First operand 207 states and 282 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:49,785 INFO L93 Difference]: Finished difference Result 424 states and 590 transitions. [2025-03-04 03:00:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:00:49,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 74 [2025-03-04 03:00:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:49,787 INFO L225 Difference]: With dead ends: 424 [2025-03-04 03:00:49,787 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 03:00:49,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-03-04 03:00:49,788 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:49,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:00:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 03:00:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212. [2025-03-04 03:00:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 158 states have (on average 1.259493670886076) internal successors, (199), 167 states have internal predecessors, (199), 36 states have call successors, (36), 11 states have call predecessors, (36), 17 states have return successors, (52), 33 states have call predecessors, (52), 34 states have call successors, (52) [2025-03-04 03:00:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 287 transitions. [2025-03-04 03:00:49,807 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 287 transitions. Word has length 74 [2025-03-04 03:00:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:49,807 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 287 transitions. [2025-03-04 03:00:49,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 03:00:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2025-03-04 03:00:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 03:00:49,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:49,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:49,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 03:00:50,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 03:00:50,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:50,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1024782788, now seen corresponding path program 1 times [2025-03-04 03:00:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:50,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680679544] [2025-03-04 03:00:50,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:50,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:00:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:00:50,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:50,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:00:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680679544] [2025-03-04 03:00:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680679544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797310864] [2025-03-04 03:00:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:50,227 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:50,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 03:00:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:00:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:00:50,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:50,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:00:50,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 03:00:50,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797310864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:50,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-04 03:00:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812056427] [2025-03-04 03:00:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:50,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:00:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:50,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:00:50,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:50,391 INFO L87 Difference]: Start difference. First operand 212 states and 287 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:50,447 INFO L93 Difference]: Finished difference Result 400 states and 565 transitions. [2025-03-04 03:00:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:00:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2025-03-04 03:00:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:50,450 INFO L225 Difference]: With dead ends: 400 [2025-03-04 03:00:50,450 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 03:00:50,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:50,452 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:50,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:00:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 03:00:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2025-03-04 03:00:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 172 states have internal predecessors, (204), 36 states have call successors, (36), 11 states have call predecessors, (36), 17 states have return successors, (52), 33 states have call predecessors, (52), 34 states have call successors, (52) [2025-03-04 03:00:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 292 transitions. [2025-03-04 03:00:50,472 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 292 transitions. Word has length 75 [2025-03-04 03:00:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:50,473 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 292 transitions. [2025-03-04 03:00:50,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 03:00:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 292 transitions. [2025-03-04 03:00:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 03:00:50,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:50,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:50,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 03:00:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 03:00:50,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:50,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2112188675, now seen corresponding path program 1 times [2025-03-04 03:00:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343818007] [2025-03-04 03:00:50,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:50,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 03:00:50,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 03:00:50,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 03:00:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343818007] [2025-03-04 03:00:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343818007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468429219] [2025-03-04 03:00:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:50,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:50,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:50,880 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:00:50,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 03:00:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 03:00:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 03:00:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:51,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 03:00:51,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:51,163 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 [2025-03-04 03:00:51,186 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 [2025-03-04 03:00:51,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,286 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 [2025-03-04 03:00:51,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,306 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 [2025-03-04 03:00:51,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 03:00:51,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-04 03:00:51,469 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-04 03:00:51,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 127 [2025-03-04 03:00:51,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2025-03-04 03:00:51,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-04 03:00:51,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:51,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35