./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_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_remove_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 f1ed2bbae9bfc9fe23e20625a052e41a5dc8bd90714a305d96277dd3b876e5be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:59:38,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:38,323 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:38,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:38,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:38,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:38,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:38,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:38,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:38,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:38,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:38,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:38,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:38,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:38,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:38,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:38,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:38,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:38,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:38,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:38,351 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 -> f1ed2bbae9bfc9fe23e20625a052e41a5dc8bd90714a305d96277dd3b876e5be [2025-03-04 02:59:38,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:38,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:38,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:38,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:38,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:38,585 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_remove_harness.i [2025-03-04 02:59:39,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d5704b0/1882b98b0a0546339b5f728b48961d50/FLAG48ed4e569 [2025-03-04 02:59:40,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:40,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness.i [2025-03-04 02:59:40,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d5704b0/1882b98b0a0546339b5f728b48961d50/FLAG48ed4e569 [2025-03-04 02:59:40,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d5704b0/1882b98b0a0546339b5f728b48961d50 [2025-03-04 02:59:40,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:40,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:40,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:40,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:40,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:40,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:40" (1/1) ... [2025-03-04 02:59:40,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eeb5f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:40, skipping insertion in model container [2025-03-04 02:59:40,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:40" (1/1) ... [2025-03-04 02:59:40,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:40,529 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_remove_harness.i[4496,4509] [2025-03-04 02:59:40,536 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_remove_harness.i[4556,4569] [2025-03-04 02:59:40,982 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,987 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,987 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,988 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,988 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,998 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:40,998 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,000 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,000 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,001 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,002 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,002 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,002 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,294 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_remove_harness.i[150649,150662] [2025-03-04 02:59:41,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:41,310 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:59:41,318 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_remove_harness.i[4496,4509] [2025-03-04 02:59:41,318 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_remove_harness.i[4556,4569] [2025-03-04 02:59:41,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,358 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:41,435 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_remove_harness.i[150649,150662] [2025-03-04 02:59:41,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:41,560 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:59:41,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:41 WrapperNode [2025-03-04 02:59:41,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:41,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:41,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:59:41,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:59:41,565 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:41" (1/1) ... [2025-03-04 02:59:41,626 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:41" (1/1) ... [2025-03-04 02:59:41,647 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 86 [2025-03-04 02:59:41,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:41,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:59:41,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:59:41,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:59:41,654 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:41" (1/1) ... [2025-03-04 02:59:41,654 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:41" (1/1) ... [2025-03-04 02:59:41,657 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:41" (1/1) ... [2025-03-04 02:59:41,672 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 5, 23]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 7 writes are split as follows [0, 0, 7]. [2025-03-04 02:59:41,672 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:41" (1/1) ... [2025-03-04 02:59:41,672 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:41" (1/1) ... [2025-03-04 02:59:41,680 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:41" (1/1) ... [2025-03-04 02:59:41,681 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:41" (1/1) ... [2025-03-04 02:59:41,683 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:41" (1/1) ... [2025-03-04 02:59:41,684 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:41" (1/1) ... [2025-03-04 02:59:41,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:59:41,687 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:59:41,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:59:41,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:59:41,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:41" (1/1) ... [2025-03-04 02:59:41,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:41,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:41,712 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:41,714 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:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 02:59:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-03-04 02:59:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:59:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:59:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:59:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 02:59:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 02:59:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 02:59:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:59:41,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:59:41,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:59:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:59:41,733 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:59:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:59:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:59:41,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:59:41,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:59:41,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:59:41,935 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-04 02:59:42,002 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-04 02:59:42,107 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-04 02:59:42,107 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:59:42,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:59:42,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:59:42,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:42 BoogieIcfgContainer [2025-03-04 02:59:42,115 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:59:42,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:59:42,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:59:42,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:59:42,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:40" (1/3) ... [2025-03-04 02:59:42,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac62966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:42, skipping insertion in model container [2025-03-04 02:59:42,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:41" (2/3) ... [2025-03-04 02:59:42,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac62966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:42, skipping insertion in model container [2025-03-04 02:59:42,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:42" (3/3) ... [2025-03-04 02:59:42,123 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness.i [2025-03-04 02:59:42,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:59:42,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_remove_harness.i that has 10 procedures, 80 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 02:59:42,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:59:42,172 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;@22f676d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:59:42,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:59:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 02:59:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 02:59:42,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:42,179 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:42,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1553950321, now seen corresponding path program 1 times [2025-03-04 02:59:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718512738] [2025-03-04 02:59:42,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:42,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:59:42,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:59:42,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:42,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 02:59:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718512738] [2025-03-04 02:59:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718512738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975660933] [2025-03-04 02:59:42,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:42,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:42,492 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:42,493 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:42,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:59:42,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:59:42,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:42,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:42,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:59:42,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 02:59:42,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975660933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:59:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672166543] [2025-03-04 02:59:42,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:42,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:59:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:59:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:42,672 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:59:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:42,690 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2025-03-04 02:59:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:59:42,691 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, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-03-04 02:59:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:42,696 INFO L225 Difference]: With dead ends: 138 [2025-03-04 02:59:42,697 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 02:59:42,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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:42,701 INFO L435 NwaCegarLoop]: 89 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, 89 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:42,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 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:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 02:59:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 02:59:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 02:59:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-03-04 02:59:42,733 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 47 [2025-03-04 02:59:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-03-04 02:59:42,735 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, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:59:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-03-04 02:59:42,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 02:59:42,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:42,737 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:42,743 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:42,937 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:42,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1780213379, now seen corresponding path program 1 times [2025-03-04 02:59:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456833466] [2025-03-04 02:59:42,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:42,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 02:59:43,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:59:43,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:43,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456833466] [2025-03-04 02:59:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456833466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:43,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:59:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069882964] [2025-03-04 02:59:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:59:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:43,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:59:43,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:59:43,653 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:43,852 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2025-03-04 02:59:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:59:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-04 02:59:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:43,854 INFO L225 Difference]: With dead ends: 134 [2025-03-04 02:59:43,855 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 02:59:43,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:43,855 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:43,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 438 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:59:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 02:59:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-03-04 02:59:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-04 02:59:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-04 02:59:43,868 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 53 [2025-03-04 02:59:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:43,869 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-04 02:59:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-04 02:59:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 02:59:43,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:43,870 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:59:43,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2131013316, now seen corresponding path program 1 times [2025-03-04 02:59:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408301218] [2025-03-04 02:59:43,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 02:59:43,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:59:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408301218] [2025-03-04 02:59:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408301218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:59:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708103783] [2025-03-04 02:59:44,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:59:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:44,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:59:44,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:59:44,153 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:44,201 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-03-04 02:59:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:59:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2025-03-04 02:59:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:44,202 INFO L225 Difference]: With dead ends: 82 [2025-03-04 02:59:44,203 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 02:59:44,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:59:44,204 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:44,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 02:59:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2025-03-04 02:59:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-03-04 02:59:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2025-03-04 02:59:44,211 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 53 [2025-03-04 02:59:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2025-03-04 02:59:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2025-03-04 02:59:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 02:59:44,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:44,212 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:44,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:59:44,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 752997712, now seen corresponding path program 1 times [2025-03-04 02:59:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132090061] [2025-03-04 02:59:44,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:44,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:59:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:59:44,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:44,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132090061] [2025-03-04 02:59:44,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132090061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:44,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:44,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:59:44,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647404885] [2025-03-04 02:59:44,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:44,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:59:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:44,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:59:44,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:59:44,401 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:44,419 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2025-03-04 02:59:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:59:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2025-03-04 02:59:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:44,422 INFO L225 Difference]: With dead ends: 141 [2025-03-04 02:59:44,422 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 02:59:44,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:59:44,424 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:44,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 02:59:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 02:59:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-03-04 02:59:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2025-03-04 02:59:44,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 54 [2025-03-04 02:59:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:44,436 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2025-03-04 02:59:44,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2025-03-04 02:59:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 02:59:44,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:44,437 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:59:44,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 424100937, now seen corresponding path program 1 times [2025-03-04 02:59:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363318722] [2025-03-04 02:59:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:59:44,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:59:44,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363318722] [2025-03-04 02:59:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363318722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775354809] [2025-03-04 02:59:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:44,691 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:44,692 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:44,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:59:44,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:59:44,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:44,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:44,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 02:59:44,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:44,964 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 11 treesize of output 7 [2025-03-04 02:59:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:59:45,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:45,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 02:59:45,570 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 16 treesize of output 14 [2025-03-04 02:59:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775354809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:45,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 10] total 26 [2025-03-04 02:59:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485893422] [2025-03-04 02:59:45,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:59:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:45,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:59:45,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:59:45,639 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 26 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:46,686 INFO L93 Difference]: Finished difference Result 171 states and 208 transitions. [2025-03-04 02:59:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:59:46,687 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 55 [2025-03-04 02:59:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:46,688 INFO L225 Difference]: With dead ends: 171 [2025-03-04 02:59:46,688 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 02:59:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=1784, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 02:59:46,689 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:46,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1283 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:59:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 02:59:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2025-03-04 02:59:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2025-03-04 02:59:46,698 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 55 [2025-03-04 02:59:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:46,699 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2025-03-04 02:59:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 23 states have internal predecessors, (62), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2025-03-04 02:59:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 02:59:46,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:46,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:46,709 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:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:46,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash -700148945, now seen corresponding path program 1 times [2025-03-04 02:59:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755344512] [2025-03-04 02:59:46,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:46,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 02:59:46,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:59:46,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:46,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 02:59:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755344512] [2025-03-04 02:59:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755344512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258103199] [2025-03-04 02:59:47,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:47,139 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:47,141 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:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 02:59:47,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 02:59:47,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 02:59:47,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:47,396 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 11 treesize of output 7 [2025-03-04 02:59:47,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:59:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:59:47,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:48,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 02:59:48,175 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 27 treesize of output 23 [2025-03-04 02:59:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258103199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:48,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 12] total 31 [2025-03-04 02:59:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326359023] [2025-03-04 02:59:48,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:48,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 02:59:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:48,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 02:59:48,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2025-03-04 02:59:48,242 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 31 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:49,327 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2025-03-04 02:59:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:59:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 58 [2025-03-04 02:59:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:49,328 INFO L225 Difference]: With dead ends: 163 [2025-03-04 02:59:49,328 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 02:59:49,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=2403, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 02:59:49,330 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 132 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:49,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1292 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:59:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 02:59:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2025-03-04 02:59:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2025-03-04 02:59:49,338 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 58 [2025-03-04 02:59:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:49,338 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2025-03-04 02:59:49,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2025-03-04 02:59:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 02:59:49,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:49,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:49,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:59:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1195855463, now seen corresponding path program 2 times [2025-03-04 02:59:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043268609] [2025-03-04 02:59:49,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:59:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:49,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 02:59:49,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 02:59:49,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:59:49,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:49,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043268609] [2025-03-04 02:59:49,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043268609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:49,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246641240] [2025-03-04 02:59:49,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:59:49,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:49,767 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:49,768 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:49,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 02:59:49,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 02:59:49,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:59:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 02:59:49,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:50,076 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 11 treesize of output 7 [2025-03-04 02:59:50,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:59:50,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:50,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:59:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:59:50,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:51,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-04 02:59:51,293 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 36 treesize of output 32 [2025-03-04 02:59:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246641240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:51,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 22, 15] total 39 [2025-03-04 02:59:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118214596] [2025-03-04 02:59:51,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:51,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 02:59:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:51,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 02:59:51,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 02:59:51,350 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 39 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 02:59:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:53,244 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2025-03-04 02:59:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:59:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2025-03-04 02:59:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:53,246 INFO L225 Difference]: With dead ends: 171 [2025-03-04 02:59:53,246 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 02:59:53,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=370, Invalid=4460, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 02:59:53,247 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 159 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:53,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1805 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 02:59:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 02:59:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2025-03-04 02:59:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 72 states have internal predecessors, (86), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2025-03-04 02:59:53,259 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 61 [2025-03-04 02:59:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:53,259 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2025-03-04 02:59:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.257142857142857) internal successors, (79), 34 states have internal predecessors, (79), 9 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 02:59:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2025-03-04 02:59:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 02:59:53,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:53,260 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:53,268 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:53,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:53,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:53,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:53,461 INFO L85 PathProgramCache]: Analyzing trace with hash -709192535, now seen corresponding path program 1 times [2025-03-04 02:59:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8338957] [2025-03-04 02:59:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:53,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:59:53,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:59:53,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:53,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8338957] [2025-03-04 02:59:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8338957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673407612] [2025-03-04 02:59:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:53,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:53,720 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:53,722 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:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 02:59:53,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:59:53,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:53,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:53,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:59:53,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:59:53,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:59:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673407612] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:59:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 6] total 13 [2025-03-04 02:59:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50128288] [2025-03-04 02:59:53,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:59:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:53,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:59:53,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:53,987 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 02:59:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:54,006 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2025-03-04 02:59:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:59:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2025-03-04 02:59:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:54,008 INFO L225 Difference]: With dead ends: 145 [2025-03-04 02:59:54,009 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 02:59:54,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:54,013 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:54,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 02:59:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 02:59:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2025-03-04 02:59:54,027 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 65 [2025-03-04 02:59:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2025-03-04 02:59:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 02:59:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2025-03-04 02:59:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 02:59:54,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:54,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:54,036 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 02:59:54,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:54,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:54,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash 868410509, now seen corresponding path program 3 times [2025-03-04 02:59:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56771225] [2025-03-04 02:59:54,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:59:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:54,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 4 equivalence classes. [2025-03-04 02:59:54,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 62 of 64 statements. [2025-03-04 02:59:54,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:59:54,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 02:59:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56771225] [2025-03-04 02:59:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56771225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372819447] [2025-03-04 02:59:54,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:59:54,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:54,503 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 02:59:54,503 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 02:59:54,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 4 equivalence classes. [2025-03-04 02:59:54,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 62 of 64 statements. [2025-03-04 02:59:54,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:59:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:54,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 02:59:54,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:54,925 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 11 treesize of output 7 [2025-03-04 02:59:54,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:59:54,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:59:54,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:54,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:59:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 02:59:55,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372819447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:55,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:59:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 20 [2025-03-04 02:59:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862159294] [2025-03-04 02:59:55,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:55,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:59:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:55,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:59:55,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:59:55,234 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 02:59:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:55,728 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2025-03-04 02:59:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:59:55,730 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 64 [2025-03-04 02:59:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:55,731 INFO L225 Difference]: With dead ends: 169 [2025-03-04 02:59:55,731 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 02:59:55,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 02:59:55,731 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 101 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:55,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 998 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:59:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 02:59:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-03-04 02:59:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 73 states have internal predecessors, (86), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-03-04 02:59:55,742 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 64 [2025-03-04 02:59:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:55,743 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-03-04 02:59:55,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 5 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 02:59:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-03-04 02:59:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 02:59:55,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:55,743 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:55,751 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 02:59:55,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:55,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:55,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1121406906, now seen corresponding path program 4 times [2025-03-04 02:59:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:55,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815606875] [2025-03-04 02:59:55,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:59:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:55,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-04 02:59:56,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:59:56,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:59:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 02:59:56,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815606875] [2025-03-04 02:59:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815606875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807391404] [2025-03-04 02:59:56,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:59:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:56,217 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 02:59:56,219 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 02:59:56,352 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-04 02:59:56,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 02:59:56,472 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:59:56,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 02:59:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:56,644 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 13 treesize of output 9 [2025-03-04 02:59:56,674 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-04 02:59:56,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 02:59:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:59:57,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:57,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-04 02:59:57,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-04 02:59:57,675 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 106 treesize of output 98 [2025-03-04 02:59:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807391404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:57,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:57,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 17] total 44 [2025-03-04 02:59:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841785452] [2025-03-04 02:59:57,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:57,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 02:59:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:57,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 02:59:57,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1757, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 02:59:57,820 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:59,506 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2025-03-04 02:59:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 02:59:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 65 [2025-03-04 02:59:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:59,507 INFO L225 Difference]: With dead ends: 174 [2025-03-04 02:59:59,507 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 02:59:59,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=341, Invalid=4629, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 02:59:59,509 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 140 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:59,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2194 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 02:59:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 02:59:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2025-03-04 02:59:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 76 states have internal predecessors, (90), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 02:59:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2025-03-04 02:59:59,521 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 65 [2025-03-04 02:59:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2025-03-04 02:59:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 02:59:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2025-03-04 02:59:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 02:59:59,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:59,522 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:59,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:59:59,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:59,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:59,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1324847638, now seen corresponding path program 1 times [2025-03-04 02:59:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51448883] [2025-03-04 02:59:59,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 02:59:59,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 02:59:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:59,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51448883] [2025-03-04 02:59:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51448883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657946168] [2025-03-04 02:59:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:59,985 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 02:59:59,986 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:00,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 03:00:00,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 03:00:00,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:00,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:00,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 03:00:00,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 03:00:00,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 03:00:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657946168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:00,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 5] total 18 [2025-03-04 03:00:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208744022] [2025-03-04 03:00:00,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:00,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 03:00:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 03:00:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 03:00:00,330 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 03:00:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:00,516 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2025-03-04 03:00:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 03:00:00,517 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 69 [2025-03-04 03:00:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:00,517 INFO L225 Difference]: With dead ends: 173 [2025-03-04 03:00:00,517 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 03:00:00,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2025-03-04 03:00:00,518 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:00,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 843 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 03:00:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 03:00:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 77 states have internal predecessors, (88), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:00:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-03-04 03:00:00,533 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 69 [2025-03-04 03:00:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:00,533 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-03-04 03:00:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 03:00:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-03-04 03:00:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 03:00:00,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:00,534 INFO L218 NwaCegarLoop]: trace histogram [7, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:00,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:00,734 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,SelfDestructingSolverStorable10 [2025-03-04 03:00:00,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash -94656923, now seen corresponding path program 5 times [2025-03-04 03:00:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:00,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832063888] [2025-03-04 03:00:00,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 03:00:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:00,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 5 equivalence classes. [2025-03-04 03:00:00,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 03:00:00,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 03:00:00,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 03:00:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832063888] [2025-03-04 03:00:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832063888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230512972] [2025-03-04 03:00:01,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 03:00:01,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:01,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:01,073 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:01,075 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:01,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 5 equivalence classes. [2025-03-04 03:00:02,294 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 03:00:02,294 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 03:00:02,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:02,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-04 03:00:02,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:02,397 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 11 treesize of output 7 [2025-03-04 03:00:02,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 03:00:02,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:02,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 03:00:02,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:02,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 03:00:02,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:02,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 03:00:02,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:02,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 03:00:02,628 INFO L349 Elim1Store]: treesize reduction 106, result has 33.3 percent of original size [2025-03-04 03:00:02,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 03:00:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:04,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2025-03-04 03:00:06,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2025-03-04 03:00:06,200 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 67 treesize of output 63 [2025-03-04 03:00:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 33 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 03:00:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230512972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:06,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:06,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26, 19] total 51 [2025-03-04 03:00:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948346556] [2025-03-04 03:00:06,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:06,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 03:00:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:06,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 03:00:06,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2344, Unknown=1, NotChecked=0, Total=2550 [2025-03-04 03:00:06,271 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 51 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:15,321 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2025-03-04 03:00:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 03:00:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 69 [2025-03-04 03:00:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:15,322 INFO L225 Difference]: With dead ends: 180 [2025-03-04 03:00:15,322 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 03:00:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=460, Invalid=6016, Unknown=4, NotChecked=0, Total=6480 [2025-03-04 03:00:15,324 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 147 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:15,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1699 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:00:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 03:00:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2025-03-04 03:00:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:00:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2025-03-04 03:00:15,338 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 69 [2025-03-04 03:00:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:15,338 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2025-03-04 03:00:15,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2025-03-04 03:00:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 03:00:15,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:15,339 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:15,350 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:15,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:15,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:15,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1088086517, now seen corresponding path program 6 times [2025-03-04 03:00:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149361888] [2025-03-04 03:00:15,540 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 03:00:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:15,563 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 6 equivalence classes. [2025-03-04 03:00:15,674 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 03:00:15,674 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 03:00:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 03:00:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149361888] [2025-03-04 03:00:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149361888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925263926] [2025-03-04 03:00:15,917 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 03:00:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:15,919 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:15,921 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:16,076 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 6 equivalence classes. [2025-03-04 03:00:17,076 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 03:00:17,076 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 03:00:17,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:17,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-04 03:00:17,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:17,173 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 11 treesize of output 7 [2025-03-04 03:00:17,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 03:00:17,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 03:00:17,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 03:00:17,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 03:00:17,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 03:00:17,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 03:00:17,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:17,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 03:00:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:18,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:20,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2025-03-04 03:00:20,699 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 89 treesize of output 85 [2025-03-04 03:00:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:00:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925263926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:20,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28, 23] total 58 [2025-03-04 03:00:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244750395] [2025-03-04 03:00:20,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:20,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-04 03:00:20,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:20,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-04 03:00:20,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3036, Unknown=0, NotChecked=0, Total=3306 [2025-03-04 03:00:20,800 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 54 states have internal predecessors, (104), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:42,029 WARN L286 SmtUtils]: Spent 18.50s on a formula simplification. DAG size of input: 180 DAG size of output: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 03:00:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:43,672 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2025-03-04 03:00:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 03:00:43,673 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 54 states have internal predecessors, (104), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 72 [2025-03-04 03:00:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:43,674 INFO L225 Difference]: With dead ends: 188 [2025-03-04 03:00:43,674 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 03:00:43,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=600, Invalid=8142, Unknown=0, NotChecked=0, Total=8742 [2025-03-04 03:00:43,676 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 178 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:43,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1738 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 03:00:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 03:00:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2025-03-04 03:00:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 83 states have internal predecessors, (96), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:00:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2025-03-04 03:00:43,690 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 72 [2025-03-04 03:00:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:43,690 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2025-03-04 03:00:43,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 54 states have internal predecessors, (104), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2025-03-04 03:00:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 03:00:43,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:43,691 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:43,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 03:00:43,891 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,SelfDestructingSolverStorable12 [2025-03-04 03:00:43,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:43,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1907410301, now seen corresponding path program 7 times [2025-03-04 03:00:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255383070] [2025-03-04 03:00:43,892 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 03:00:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:43,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:00:43,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:00:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-04 03:00:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255383070] [2025-03-04 03:00:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255383070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197459838] [2025-03-04 03:00:44,291 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 03:00:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:44,293 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:44,297 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:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 03:00:44,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 03:00:44,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:44,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-04 03:00:44,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:44,812 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 13 treesize of output 9 [2025-03-04 03:00:44,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 03:00:44,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:44,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 03:00:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:45,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:46,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-04 03:00:46,580 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 36 treesize of output 32 [2025-03-04 03:00:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:00:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197459838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:46,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:46,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 30, 24] total 62 [2025-03-04 03:00:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607384649] [2025-03-04 03:00:46,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:46,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 03:00:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:46,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 03:00:46,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 03:00:46,988 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 62 states, 60 states have (on average 1.85) internal successors, (111), 59 states have internal predecessors, (111), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:49,992 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2025-03-04 03:00:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 03:00:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.85) internal successors, (111), 59 states have internal predecessors, (111), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 75 [2025-03-04 03:00:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:49,993 INFO L225 Difference]: With dead ends: 190 [2025-03-04 03:00:49,993 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 03:00:49,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=531, Invalid=8399, Unknown=0, NotChecked=0, Total=8930 [2025-03-04 03:00:49,995 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:49,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 2567 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 03:00:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 03:00:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2025-03-04 03:00:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 86 states have internal predecessors, (100), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:00:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2025-03-04 03:00:50,030 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 75 [2025-03-04 03:00:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:50,030 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2025-03-04 03:00:50,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.85) internal successors, (111), 59 states have internal predecessors, (111), 7 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:00:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2025-03-04 03:00:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 03:00:50,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:50,031 INFO L218 NwaCegarLoop]: trace histogram [10, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:50,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 03:00:50,239 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,SelfDestructingSolverStorable13 [2025-03-04 03:00:50,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -524784819, now seen corresponding path program 2 times [2025-03-04 03:00:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854342469] [2025-03-04 03:00:50,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:50,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 03:00:50,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:00:50,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:50,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 03:00:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854342469] [2025-03-04 03:00:50,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854342469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526376191] [2025-03-04 03:00:50,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:50,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:50,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:50,570 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:50,571 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:50,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-04 03:00:50,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:00:50,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:50,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:50,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 03:00:50,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 03:00:50,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-04 03:00:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526376191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:51,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 8] total 26 [2025-03-04 03:00:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230988773] [2025-03-04 03:00:51,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 03:00:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:51,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 03:00:51,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2025-03-04 03:00:51,137 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:00:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:51,513 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2025-03-04 03:00:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 03:00:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-04 03:00:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:51,515 INFO L225 Difference]: With dead ends: 170 [2025-03-04 03:00:51,515 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 03:00:51,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 03:00:51,515 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 19 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:00:51,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1137 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:00:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 03:00:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 03:00:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 91 states have internal predecessors, (104), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:00:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-03-04 03:00:51,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 79 [2025-03-04 03:00:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:51,564 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-03-04 03:00:51,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 2 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:00:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-03-04 03:00:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 03:00:51,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:51,566 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:00:51,585 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:51,766 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,SelfDestructingSolverStorable14 [2025-03-04 03:00:51,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:51,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:51,767 INFO L85 PathProgramCache]: Analyzing trace with hash 874359145, now seen corresponding path program 8 times [2025-03-04 03:00:51,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:51,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25195245] [2025-03-04 03:00:51,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:51,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 03:00:51,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 03:00:51,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:51,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 03:00:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25195245] [2025-03-04 03:00:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25195245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029707211] [2025-03-04 03:00:52,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:52,292 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:52,298 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:52,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 03:00:52,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 03:00:52,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 03:00:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:52,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-04 03:00:52,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:52,849 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 11 treesize of output 7 [2025-03-04 03:00:52,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 03:00:52,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:52,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 03:00:52,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:52,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 03:00:52,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:52,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 03:00:53,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 03:00:53,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 03:00:53,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 03:00:53,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-03-04 03:00:53,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-03-04 03:00:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 111 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 03:00:54,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:59,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2025-03-04 03:00:59,951 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 107 treesize of output 103 [2025-03-04 03:01:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:01:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029707211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:01:00,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:01:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32, 27] total 68 [2025-03-04 03:01:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453811123] [2025-03-04 03:01:00,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:01:00,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 03:01:00,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:00,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 03:01:00,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=4255, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 03:01:00,053 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 68 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 64 states have internal predecessors, (118), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:01:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:04,831 INFO L93 Difference]: Finished difference Result 204 states and 241 transitions. [2025-03-04 03:01:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 03:01:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 64 states have internal predecessors, (118), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 78 [2025-03-04 03:01:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:04,833 INFO L225 Difference]: With dead ends: 204 [2025-03-04 03:01:04,833 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 03:01:04,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=679, Invalid=10663, Unknown=0, NotChecked=0, Total=11342 [2025-03-04 03:01:04,835 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 150 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:04,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 2695 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 03:01:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 03:01:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2025-03-04 03:01:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 92 states have internal predecessors, (104), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:01:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2025-03-04 03:01:04,855 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 78 [2025-03-04 03:01:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2025-03-04 03:01:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 64 states have internal predecessors, (118), 8 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-04 03:01:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2025-03-04 03:01:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 03:01:04,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:04,856 INFO L218 NwaCegarLoop]: trace histogram [11, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:04,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 03:01:05,056 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,SelfDestructingSolverStorable15 [2025-03-04 03:01:05,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 39479201, now seen corresponding path program 9 times [2025-03-04 03:01:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910167505] [2025-03-04 03:01:05,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 03:01:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:05,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 9 equivalence classes. [2025-03-04 03:01:05,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 81 statements. [2025-03-04 03:01:05,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 03:01:05,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 03:01:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910167505] [2025-03-04 03:01:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910167505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283386279] [2025-03-04 03:01:05,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 03:01:05,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:05,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:05,675 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:01:05,677 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:01:05,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 9 equivalence classes. [2025-03-04 03:01:09,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 81 statements. [2025-03-04 03:01:09,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 03:01:09,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:09,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-04 03:01:09,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:09,224 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 11 treesize of output 7 [2025-03-04 03:01:09,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 03:01:09,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 03:01:09,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 03:01:09,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 03:01:09,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 03:01:09,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 03:01:09,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 03:01:09,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-03-04 03:01:09,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-03-04 03:01:09,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:09,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-03-04 03:01:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 03:01:09,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:01:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283386279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:10,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 03:01:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2025-03-04 03:01:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899853237] [2025-03-04 03:01:10,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 03:01:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 03:01:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:10,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 03:01:10,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-03-04 03:01:10,029 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 03:01:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:10,337 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2025-03-04 03:01:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 03:01:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2025-03-04 03:01:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:10,339 INFO L225 Difference]: With dead ends: 200 [2025-03-04 03:01:10,339 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 03:01:10,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 03:01:10,340 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:10,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:01:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 03:01:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2025-03-04 03:01:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 93 states have internal predecessors, (105), 18 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 03:01:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2025-03-04 03:01:10,359 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 81 [2025-03-04 03:01:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:10,360 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2025-03-04 03:01:10,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 5 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-04 03:01:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2025-03-04 03:01:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 03:01:10,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:10,360 INFO L218 NwaCegarLoop]: trace histogram [12, 9, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:01:10,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 03:01:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:10,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1957665528, now seen corresponding path program 10 times [2025-03-04 03:01:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256639808] [2025-03-04 03:01:10,561 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 03:01:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:10,587 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-03-04 03:01:10,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:01:10,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 03:01:10,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 03:01:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256639808] [2025-03-04 03:01:11,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256639808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220618861] [2025-03-04 03:01:11,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 03:01:11,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:11,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:11,094 INFO L229 MonitoredProcess]: Starting monitored process 16 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:01:11,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 03:01:11,331 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 82 statements into 2 equivalence classes. [2025-03-04 03:01:11,874 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:01:11,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 03:01:11,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:11,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-04 03:01:11,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:11,889 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 11 treesize of output 7 [2025-03-04 03:01:11,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 03:01:11,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:11,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 03:01:11,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:11,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 03:01:11,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:11,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 03:01:12,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 03:01:12,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 03:01:12,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 03:01:12,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-03-04 03:01:12,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-03-04 03:01:12,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-03-04 03:01:12,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:01:12,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140