./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_end_harness_negated.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 d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:08:32,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:08:32,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:08:32,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:08:32,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:08:32,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:08:32,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:08:32,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:08:32,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:08:32,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:08:32,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:08:32,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:08:32,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:08:32,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:08:32,440 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:08:32,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:08:32,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:08:32,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:08:32,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:08:32,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:08:32,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:08:32,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:08:32,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:32,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:08:32,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:08:32,443 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 -> d7b9ddf837d983b2f2db252b1327ae049806ab568e5bf2d0a60ffd182bd7d0fe [2025-03-08 18:08:32,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:08:32,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:08:32,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:08:32,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:08:32,699 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:08:32,700 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_end_harness_negated.i [2025-03-08 18:08:33,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337bc21e4/43235463f572492a859a72ccafd312fc/FLAGfb4204637 [2025-03-08 18:08:34,375 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:08:34,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness_negated.i [2025-03-08 18:08:34,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337bc21e4/43235463f572492a859a72ccafd312fc/FLAGfb4204637 [2025-03-08 18:08:34,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337bc21e4/43235463f572492a859a72ccafd312fc [2025-03-08 18:08:34,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:08:34,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:08:34,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:34,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:08:34,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:08:34,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:34" (1/1) ... [2025-03-08 18:08:34,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a88dfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:34, skipping insertion in model container [2025-03-08 18:08:34,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:34" (1/1) ... [2025-03-08 18:08:34,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:08:34,755 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_end_harness_negated.i[4493,4506] [2025-03-08 18:08:34,763 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_end_harness_negated.i[4553,4566] [2025-03-08 18:08:35,225 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,226 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,226 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,226 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,227 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,234 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,237 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,528 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_end_harness_negated.i[150674,150687] [2025-03-08 18:08:35,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:35,541 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:08:35,555 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_end_harness_negated.i[4493,4506] [2025-03-08 18:08:35,556 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_end_harness_negated.i[4553,4566] [2025-03-08 18:08:35,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,589 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,589 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,589 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,590 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,595 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,600 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,601 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,601 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,602 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,606 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:35,683 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_end_harness_negated.i[150674,150687] [2025-03-08 18:08:35,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:35,815 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:08:35,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35 WrapperNode [2025-03-08 18:08:35,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:35,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:35,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:08:35,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:08:35,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,898 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-08 18:08:35,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:35,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:08:35,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:08:35,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:08:35,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,920 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-08 18:08:35,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:08:35,938 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:08:35,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:08:35,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:08:35,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (1/1) ... [2025-03-08 18:08:35,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:35,968 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-08 18:08:35,970 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-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:08:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:08:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:08:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:08:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:08:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:08:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:08:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:08:36,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:08:36,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:08:36,229 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-08 18:08:36,238 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:08:36,419 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:08:36,442 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 18:08:36,442 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:08:36,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:08:36,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:08:36,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:36 BoogieIcfgContainer [2025-03-08 18:08:36,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:08:36,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:08:36,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:08:36,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:08:36,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:08:34" (1/3) ... [2025-03-08 18:08:36,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4df1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:36, skipping insertion in model container [2025-03-08 18:08:36,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:35" (2/3) ... [2025-03-08 18:08:36,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4df1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:36, skipping insertion in model container [2025-03-08 18:08:36,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:36" (3/3) ... [2025-03-08 18:08:36,461 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness_negated.i [2025-03-08 18:08:36,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:08:36,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_end_harness_negated.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:08:36,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:08:36,522 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;@1851fbeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:08:36,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:08:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 18:08:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:08:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:36,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:36,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:36,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-08 18:08:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878485265] [2025-03-08 18:08:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:36,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:08:36,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:08:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:08:36,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878485265] [2025-03-08 18:08:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878485265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:36,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786788896] [2025-03-08 18:08:36,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:36,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:36,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:36,838 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-08 18:08:36,838 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-08 18:08:36,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:08:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:08:37,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:37,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:08:37,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:08:37,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786788896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:37,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:08:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295790544] [2025-03-08 18:08:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:37,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:08:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:37,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:08:37,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:08:37,058 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:37,074 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-08 18:08:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:08:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 18:08:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:37,080 INFO L225 Difference]: With dead ends: 126 [2025-03-08 18:08:37,081 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 18:08:37,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:08:37,087 INFO L435 NwaCegarLoop]: 86 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, 86 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-08 18:08:37,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 18:08:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 18:08:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 18:08:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-08 18:08:37,113 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-08 18:08:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:37,113 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-08 18:08:37,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-08 18:08:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:08:37,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:37,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:37,122 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-08 18:08:37,316 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-08 18:08:37,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:37,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-08 18:08:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854532681] [2025-03-08 18:08:37,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:08:37,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:08:37,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:37,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:08:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854532681] [2025-03-08 18:08:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854532681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:08:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775833568] [2025-03-08 18:08:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:37,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:08:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:37,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:08:37,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:08:37,942 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 18:08:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:37,992 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-03-08 18:08:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:08:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2025-03-08 18:08:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:37,995 INFO L225 Difference]: With dead ends: 72 [2025-03-08 18:08:37,995 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 18:08:37,995 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-08 18:08:37,996 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:37,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 18:08:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-08 18:08:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:08:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-08 18:08:38,008 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2025-03-08 18:08:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-08 18:08:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 18:08:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-08 18:08:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 18:08:38,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:38,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:08:38,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:08:38,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:38,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 511756480, now seen corresponding path program 1 times [2025-03-08 18:08:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155116261] [2025-03-08 18:08:38,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:08:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:08:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:08:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155116261] [2025-03-08 18:08:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155116261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:08:38,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131597307] [2025-03-08 18:08:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:38,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:08:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:38,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:08:38,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:08:38,255 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:38,383 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2025-03-08 18:08:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:08:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-08 18:08:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:38,386 INFO L225 Difference]: With dead ends: 131 [2025-03-08 18:08:38,386 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 18:08:38,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:38,388 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:38,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 350 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:08:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 18:08:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-08 18:08:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:08:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-08 18:08:38,401 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 71 [2025-03-08 18:08:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-08 18:08:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-08 18:08:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:08:38,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:38,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:08:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:08:38,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 211973896, now seen corresponding path program 1 times [2025-03-08 18:08:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851514642] [2025-03-08 18:08:38,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:08:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:08:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:38,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:08:38,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:38,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851514642] [2025-03-08 18:08:38,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851514642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:38,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:38,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:08:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934154513] [2025-03-08 18:08:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:38,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:08:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:38,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:08:38,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:38,602 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:38,732 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-08 18:08:38,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:08:38,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-08 18:08:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:38,733 INFO L225 Difference]: With dead ends: 137 [2025-03-08 18:08:38,733 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 18:08:38,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:08:38,735 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:38,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 395 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:08:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 18:08:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-08 18:08:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:08:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-08 18:08:38,744 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 73 [2025-03-08 18:08:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-08 18:08:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-08 18:08:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:08:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:38,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:08:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:08:38,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -626301941, now seen corresponding path program 1 times [2025-03-08 18:08:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204471856] [2025-03-08 18:08:38,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:08:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:08:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:08:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204471856] [2025-03-08 18:08:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204471856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:08:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743566181] [2025-03-08 18:08:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:39,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:08:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:39,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:08:39,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:39,069 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:39,183 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2025-03-08 18:08:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:08:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-08 18:08:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:39,185 INFO L225 Difference]: With dead ends: 138 [2025-03-08 18:08:39,185 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 18:08:39,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:08:39,186 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:39,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 402 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:08:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 18:08:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-03-08 18:08:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:08:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-08 18:08:39,193 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 74 [2025-03-08 18:08:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:39,193 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-08 18:08:39,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:08:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-08 18:08:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:08:39,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:39,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:08:39,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:08:39,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:39,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -514954486, now seen corresponding path program 1 times [2025-03-08 18:08:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989724543] [2025-03-08 18:08:39,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:39,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:08:39,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:08:39,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:39,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 18:08:39,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989724543] [2025-03-08 18:08:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989724543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:39,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:08:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794694506] [2025-03-08 18:08:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:39,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:08:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:39,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:08:39,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:08:39,632 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:08:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:39,685 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2025-03-08 18:08:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:08:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-08 18:08:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:39,687 INFO L225 Difference]: With dead ends: 82 [2025-03-08 18:08:39,687 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 18:08:39,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:39,688 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:39,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 446 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 18:08:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2025-03-08 18:08:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:08:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-08 18:08:39,702 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 82 [2025-03-08 18:08:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:39,703 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-08 18:08:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:08:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-08 18:08:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:08:39,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:39,707 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:39,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:08:39,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 497598162, now seen corresponding path program 1 times [2025-03-08 18:08:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453338138] [2025-03-08 18:08:39,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:39,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:08:39,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:08:39,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:39,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:08:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453338138] [2025-03-08 18:08:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453338138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794328272] [2025-03-08 18:08:40,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:40,029 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-08 18:08:40,031 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-08 18:08:40,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:08:40,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:08:40,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:40,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 18:08:40,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:40,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-08 18:08:40,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-08 18:08:40,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:40,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2025-03-08 18:08:40,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2025-03-08 18:08:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:08:41,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794328272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:41,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-08 18:08:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503098896] [2025-03-08 18:08:41,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:08:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:41,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:08:41,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:08:41,026 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:08:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:41,476 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2025-03-08 18:08:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:08:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-08 18:08:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:41,478 INFO L225 Difference]: With dead ends: 201 [2025-03-08 18:08:41,478 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 18:08:41,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:08:41,479 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:41,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 432 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:08:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 18:08:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-08 18:08:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-08 18:08:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2025-03-08 18:08:41,500 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 76 [2025-03-08 18:08:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:41,501 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2025-03-08 18:08:41,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:08:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2025-03-08 18:08:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:08:41,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:41,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:08:41,512 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-08 18:08:41,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 18:08:41,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1427935149, now seen corresponding path program 1 times [2025-03-08 18:08:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988843310] [2025-03-08 18:08:41,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:41,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:08:41,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:08:41,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:41,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:08:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988843310] [2025-03-08 18:08:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988843310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073470556] [2025-03-08 18:08:41,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:41,908 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-08 18:08:41,909 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-08 18:08:42,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:08:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:08:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:42,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 18:08:42,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:42,168 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-08 18:08:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-08 18:08:42,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 18:08:42,187 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:42,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-08 18:08:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-03-08 18:08:42,510 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 18:08:42,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 18:08:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:08:42,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073470556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-08 18:08:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205287023] [2025-03-08 18:08:42,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:42,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:08:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:42,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:08:42,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:08:42,523 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:08:46,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:08:50,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:08:54,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:08:58,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:09:02,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:09:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:03,129 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2025-03-08 18:09:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:09:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-08 18:09:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:03,130 INFO L225 Difference]: With dead ends: 225 [2025-03-08 18:09:03,131 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 18:09:03,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-08 18:09:03,132 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 199 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 51 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:03,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 465 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 286 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-08 18:09:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 18:09:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2025-03-08 18:09:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.275229357798165) internal successors, (139), 115 states have internal predecessors, (139), 27 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (37), 25 states have call predecessors, (37), 25 states have call successors, (37) [2025-03-08 18:09:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 203 transitions. [2025-03-08 18:09:03,154 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 203 transitions. Word has length 76 [2025-03-08 18:09:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:03,155 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 203 transitions. [2025-03-08 18:09:03,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:09:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 203 transitions. [2025-03-08 18:09:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:09:03,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:03,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:03,165 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-08 18:09:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:03,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:03,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -734542444, now seen corresponding path program 1 times [2025-03-08 18:09:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714960684] [2025-03-08 18:09:03,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:03,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:09:03,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:09:03,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:03,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:09:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714960684] [2025-03-08 18:09:03,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714960684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285333274] [2025-03-08 18:09:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:03,568 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-08 18:09:03,569 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-08 18:09:03,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:09:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:09:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:03,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 18:09:03,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:03,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:03,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 18:09:04,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:09:04,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285333274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:04,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 12] total 28 [2025-03-08 18:09:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080770244] [2025-03-08 18:09:04,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 18:09:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:04,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 18:09:04,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-08 18:09:04,982 INFO L87 Difference]: Start difference. First operand 152 states and 203 transitions. Second operand has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-08 18:09:09,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:09:13,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:09:17,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:09:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:18,357 INFO L93 Difference]: Finished difference Result 539 states and 788 transitions. [2025-03-08 18:09:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 18:09:18,357 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 76 [2025-03-08 18:09:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:18,359 INFO L225 Difference]: With dead ends: 539 [2025-03-08 18:09:18,359 INFO L226 Difference]: Without dead ends: 400 [2025-03-08 18:09:18,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=2152, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 18:09:18,363 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 185 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 91 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:18,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1520 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1114 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-03-08 18:09:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-08 18:09:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 342. [2025-03-08 18:09:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 265 states have internal predecessors, (317), 55 states have call successors, (55), 23 states have call predecessors, (55), 37 states have return successors, (106), 53 states have call predecessors, (106), 51 states have call successors, (106) [2025-03-08 18:09:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 478 transitions. [2025-03-08 18:09:18,410 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 478 transitions. Word has length 76 [2025-03-08 18:09:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:18,410 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 478 transitions. [2025-03-08 18:09:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-08 18:09:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2025-03-08 18:09:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:09:18,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:18,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:18,423 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-08 18:09:18,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:18,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:18,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -521552676, now seen corresponding path program 1 times [2025-03-08 18:09:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656430176] [2025-03-08 18:09:18,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:18,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:18,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 18:09:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656430176] [2025-03-08 18:09:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656430176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610603055] [2025-03-08 18:09:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:18,836 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-08 18:09:18,838 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-08 18:09:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:18,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:18,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:18,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 18:09:18,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:19,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-08 18:09:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:09:19,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-08 18:09:19,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-08 18:09:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:09:20,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610603055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 18:09:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676417469] [2025-03-08 18:09:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:20,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:09:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:20,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:09:20,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:09:20,315 INFO L87 Difference]: Start difference. First operand 342 states and 478 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:20,839 INFO L93 Difference]: Finished difference Result 523 states and 717 transitions. [2025-03-08 18:09:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:09:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-08 18:09:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:20,841 INFO L225 Difference]: With dead ends: 523 [2025-03-08 18:09:20,841 INFO L226 Difference]: Without dead ends: 342 [2025-03-08 18:09:20,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:09:20,844 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:20,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 447 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:09:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-08 18:09:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2025-03-08 18:09:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 259 states have internal predecessors, (310), 55 states have call successors, (55), 23 states have call predecessors, (55), 35 states have return successors, (101), 53 states have call predecessors, (101), 51 states have call successors, (101) [2025-03-08 18:09:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 466 transitions. [2025-03-08 18:09:20,895 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 466 transitions. Word has length 88 [2025-03-08 18:09:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:20,895 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 466 transitions. [2025-03-08 18:09:20,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 466 transitions. [2025-03-08 18:09:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:09:20,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:20,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:20,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 18:09:21,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 18:09:21,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:21,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2011491132, now seen corresponding path program 1 times [2025-03-08 18:09:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015671466] [2025-03-08 18:09:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:21,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:21,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:21,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:21,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 18:09:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015671466] [2025-03-08 18:09:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015671466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149402653] [2025-03-08 18:09:21,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:21,306 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-08 18:09:21,308 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-08 18:09:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:21,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:21,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:21,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 18:09:21,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:21,526 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-08 18:09:21,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-08 18:09:21,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 18:09:21,554 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:21,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-08 18:09:21,571 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:21,572 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 33 treesize of output 9 [2025-03-08 18:09:21,574 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 9 treesize of output 7 [2025-03-08 18:09:23,029 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (store .cse1 24 .cse0)) .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| .cse2) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (store .cse3 24 .cse2)) .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| .cse4) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| (store .cse5 24 .cse4)) .cse4) .cse5))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (store .cse7 24 .cse6)) .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|))))) is different from true [2025-03-08 18:09:24,120 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (store .cse1 24 .cse0)) .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_18|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| .cse2) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_10| (store .cse3 24 .cse2)) .cse2)))))))) (or |c_aws_linked_list_is_valid_#t~short308#1| (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12| .cse4) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12| (store .cse5 24 .cse4)) .cse4)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_12|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| .cse6) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19|) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_19| (store .cse7 24 .cse6)) .cse6) .cse7))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) (<= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| .cse8) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= .cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (store .cse9 24 .cse8)) .cse8))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|) 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_11|))))) is different from true [2025-03-08 18:09:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-03-08 18:09:24,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:24,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:24,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 310 [2025-03-08 18:09:24,924 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 162 treesize of output 146 [2025-03-08 18:09:24,952 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 129 treesize of output 117 [2025-03-08 18:09:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:09:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149402653] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:09:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 20] total 34 [2025-03-08 18:09:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013562366] [2025-03-08 18:09:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:25,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:25,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=835, Unknown=44, NotChecked=122, Total=1122 [2025-03-08 18:09:25,107 INFO L87 Difference]: Start difference. First operand 336 states and 466 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:25,557 INFO L93 Difference]: Finished difference Result 466 states and 645 transitions. [2025-03-08 18:09:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:09:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-08 18:09:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:25,560 INFO L225 Difference]: With dead ends: 466 [2025-03-08 18:09:25,560 INFO L226 Difference]: Without dead ends: 344 [2025-03-08 18:09:25,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=167, Invalid=1348, Unknown=53, NotChecked=154, Total=1722 [2025-03-08 18:09:25,561 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 143 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:25,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 433 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-08 18:09:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2025-03-08 18:09:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 232 states have (on average 1.2586206896551724) internal successors, (292), 244 states have internal predecessors, (292), 54 states have call successors, (54), 23 states have call predecessors, (54), 33 states have return successors, (96), 52 states have call predecessors, (96), 50 states have call successors, (96) [2025-03-08 18:09:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 442 transitions. [2025-03-08 18:09:25,596 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 442 transitions. Word has length 88 [2025-03-08 18:09:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:25,596 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 442 transitions. [2025-03-08 18:09:25,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2025-03-08 18:09:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:09:25,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:25,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:25,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:25,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:25,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1020133788, now seen corresponding path program 1 times [2025-03-08 18:09:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530183275] [2025-03-08 18:09:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:25,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:25,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 18:09:26,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530183275] [2025-03-08 18:09:26,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530183275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566834871] [2025-03-08 18:09:26,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:26,019 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-08 18:09:26,020 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-08 18:09:26,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:26,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:26,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:26,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 18:09:26,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:26,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:09:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-08 18:09:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:26,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2025-03-08 18:09:26,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:26,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:26,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:26,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2025-03-08 18:09:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:09:27,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566834871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:27,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-03-08 18:09:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798931688] [2025-03-08 18:09:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:27,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:27,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 18:09:27,428 INFO L87 Difference]: Start difference. First operand 320 states and 442 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:28,083 INFO L93 Difference]: Finished difference Result 404 states and 543 transitions. [2025-03-08 18:09:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:09:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-08 18:09:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:28,086 INFO L225 Difference]: With dead ends: 404 [2025-03-08 18:09:28,086 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 18:09:28,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-08 18:09:28,087 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 53 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:28,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 651 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:09:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 18:09:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-03-08 18:09:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 166 states have (on average 1.2530120481927711) internal successors, (208), 175 states have internal predecessors, (208), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (67), 38 states have call predecessors, (67), 37 states have call successors, (67) [2025-03-08 18:09:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 315 transitions. [2025-03-08 18:09:28,111 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 315 transitions. Word has length 88 [2025-03-08 18:09:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 315 transitions. [2025-03-08 18:09:28,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 315 transitions. [2025-03-08 18:09:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:09:28,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:28,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:28,123 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-08 18:09:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:28,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1808465916, now seen corresponding path program 1 times [2025-03-08 18:09:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970790188] [2025-03-08 18:09:28,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:28,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:28,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:28,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:28,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:09:28,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970790188] [2025-03-08 18:09:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970790188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307830828] [2025-03-08 18:09:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:28,865 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-08 18:09:28,867 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-08 18:09:28,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:29,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:29,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:29,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:29,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 18:09:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:29,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-08 18:09:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:09:29,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307830828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2025-03-08 18:09:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128532245] [2025-03-08 18:09:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:29,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:29,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2025-03-08 18:09:29,496 INFO L87 Difference]: Start difference. First operand 231 states and 315 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:29,817 INFO L93 Difference]: Finished difference Result 327 states and 445 transitions. [2025-03-08 18:09:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:09:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 88 [2025-03-08 18:09:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:29,820 INFO L225 Difference]: With dead ends: 327 [2025-03-08 18:09:29,820 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 18:09:29,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-08 18:09:29,821 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 54 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:29,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 653 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 18:09:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-08 18:09:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 168 states have (on average 1.25) internal successors, (210), 177 states have internal predecessors, (210), 40 states have call successors, (40), 17 states have call predecessors, (40), 24 states have return successors, (67), 38 states have call predecessors, (67), 37 states have call successors, (67) [2025-03-08 18:09:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2025-03-08 18:09:29,844 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 88 [2025-03-08 18:09:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2025-03-08 18:09:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:09:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2025-03-08 18:09:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:09:29,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:29,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:29,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 18:09:30,046 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,SelfDestructingSolverStorable12 [2025-03-08 18:09:30,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:30,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash -813570468, now seen corresponding path program 1 times [2025-03-08 18:09:30,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108304009] [2025-03-08 18:09:30,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:30,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:30,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:30,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:30,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:09:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108304009] [2025-03-08 18:09:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108304009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717182461] [2025-03-08 18:09:30,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:30,151 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-08 18:09:30,152 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-08 18:09:30,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:09:30,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:09:30,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:30,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:09:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 18:09:30,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717182461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:30,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:30,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-08 18:09:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532100083] [2025-03-08 18:09:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:30,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:09:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:30,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:09:30,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:09:30,353 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:09:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:30,472 INFO L93 Difference]: Finished difference Result 542 states and 757 transitions. [2025-03-08 18:09:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:09:30,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 88 [2025-03-08 18:09:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:30,475 INFO L225 Difference]: With dead ends: 542 [2025-03-08 18:09:30,475 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 18:09:30,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:09:30,492 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:30,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 345 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:09:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 18:09:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-08 18:09:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 167 states have internal predecessors, (193), 40 states have call successors, (40), 17 states have call predecessors, (40), 23 states have return successors, (64), 38 states have call predecessors, (64), 37 states have call successors, (64) [2025-03-08 18:09:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-03-08 18:09:30,522 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 88 [2025-03-08 18:09:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:30,522 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-03-08 18:09:30,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:09:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-03-08 18:09:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:09:30,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:30,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:30,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 18:09:30,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1049500798, now seen corresponding path program 1 times [2025-03-08 18:09:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766952905] [2025-03-08 18:09:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:30,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:09:30,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:09:30,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:30,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:09:30,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:30,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766952905] [2025-03-08 18:09:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766952905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216191169] [2025-03-08 18:09:30,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:30,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:30,985 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-08 18:09:30,987 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-08 18:09:31,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:09:31,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:09:31,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:31,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:31,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 18:09:31,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:31,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-08 18:09:31,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:09:31,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:09:31,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-08 18:09:31,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 18:09:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 18:09:31,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2025-03-08 18:09:31,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-08 18:09:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:31,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2025-03-08 18:09:31,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 18:09:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 18:09:32,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:32,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_ArrVal_879 Int) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_886 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_879)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_885))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_886))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_ArrVal_884 Int) (v_ArrVal_888 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_884)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_888))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-08 18:09:32,376 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:32,377 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:32,467 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:09:32,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2025-03-08 18:09:32,477 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:32,477 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:32,534 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:09:32,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 327 treesize of output 314 [2025-03-08 18:09:32,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:32,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 250 [2025-03-08 18:09:32,564 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 217 treesize of output 205 [2025-03-08 18:09:32,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:32,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 304 [2025-03-08 18:09:32,587 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 263 treesize of output 251 [2025-03-08 18:09:32,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 18:09:32,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 18:09:33,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:33,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 107 [2025-03-08 18:09:33,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:33,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 93 [2025-03-08 18:09:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-03-08 18:09:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216191169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:33,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:33,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-03-08 18:09:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62233881] [2025-03-08 18:09:33,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 18:09:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:33,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 18:09:33,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=434, Unknown=11, NotChecked=42, Total=552 [2025-03-08 18:09:33,096 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-08 18:09:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:34,037 INFO L93 Difference]: Finished difference Result 451 states and 600 transitions. [2025-03-08 18:09:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 18:09:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) Word has length 89 [2025-03-08 18:09:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:34,039 INFO L225 Difference]: With dead ends: 451 [2025-03-08 18:09:34,039 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 18:09:34,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=1168, Unknown=14, NotChecked=70, Total=1406 [2025-03-08 18:09:34,040 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 45 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:34,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1151 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 771 Invalid, 0 Unknown, 138 Unchecked, 0.6s Time] [2025-03-08 18:09:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 18:09:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2025-03-08 18:09:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 163 states have (on average 1.2085889570552146) internal successors, (197), 169 states have internal predecessors, (197), 40 states have call successors, (40), 18 states have call predecessors, (40), 22 states have return successors, (54), 38 states have call predecessors, (54), 37 states have call successors, (54) [2025-03-08 18:09:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 291 transitions. [2025-03-08 18:09:34,066 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 291 transitions. Word has length 89 [2025-03-08 18:09:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:34,066 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 291 transitions. [2025-03-08 18:09:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.043478260869565) internal successors, (116), 23 states have internal predecessors, (116), 10 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (25), 10 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-08 18:09:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 291 transitions. [2025-03-08 18:09:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 18:09:34,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:34,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:34,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:34,269 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,SelfDestructingSolverStorable14 [2025-03-08 18:09:34,269 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2054043688, now seen corresponding path program 1 times [2025-03-08 18:09:34,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:34,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278907780] [2025-03-08 18:09:34,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:34,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:09:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:09:34,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:34,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 18:09:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278907780] [2025-03-08 18:09:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278907780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486995968] [2025-03-08 18:09:34,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:34,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:34,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:34,557 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-08 18:09:34,559 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-08 18:09:34,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 18:09:34,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 18:09:34,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:34,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 18:09:34,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:34,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:09:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:09:34,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:09:34,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:09:34,844 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-08 18:09:34,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-03-08 18:09:34,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:34,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2025-03-08 18:09:34,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-08 18:09:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2025-03-08 18:09:44,192 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-08 18:09:44,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 18:09:44,320 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|) (= .cse0 (select .cse1 24)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| (store .cse2 24 .cse0)) .cse0) .cse2)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|))) (let ((.cse3 (select .cse4 0))) (and (<= (+ .cse3 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|) (= .cse3 (select .cse4 24)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| (store .cse5 24 .cse3)) .cse3))))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|))) (let ((.cse6 (select .cse8 0))) (and (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| (store .cse7 24 .cse6)) .cse6))) (= (select .cse8 24) .cse6))))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 24) .cse10) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| (store .cse11 24 .cse10)) .cse10) .cse11))))))) is different from true [2025-03-08 18:09:48,564 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46|) (= .cse0 (select .cse1 24)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_8) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_46| (store .cse2 24 .cse0)) .cse0) .cse2)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|))) (let ((.cse3 (select .cse4 0))) (and (<= (+ .cse3 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47|) (= .cse3 (select .cse4 24)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_47| (store .cse5 24 .cse3)) .cse3))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))) (let ((.cse7 (select .cse6 0))) (and (= (select .cse6 24) .cse7) (not (= .cse7 0)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_10) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30| (store .cse8 24 .cse7)) .cse7) .cse8)) (<= (+ .cse7 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_30|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|))) (let ((.cse9 (select .cse11 0))) (and (<= (+ 2 .cse9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29|) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_29| (store .cse10 24 .cse9)) .cse9))) (= (select .cse11 24) .cse9))))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31|))) (let ((.cse12 (select .cse14 0))) (and (not (= .cse12 0)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= .cse13 (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31| (store .cse13 24 .cse12)) .cse12))) (<= (+ 2 .cse12) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_31|) (= (select .cse14 24) .cse12)))))) is different from true [2025-03-08 18:09:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 22 refuted. 11 times theorem prover too weak. 3 trivial. 6 not checked. [2025-03-08 18:09:49,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:50,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 126 [2025-03-08 18:09:50,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,198 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 154 [2025-03-08 18:09:50,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 625 treesize of output 559 [2025-03-08 18:09:50,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 830 treesize of output 836 [2025-03-08 18:09:50,251 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 673 treesize of output 665 [2025-03-08 18:09:50,262 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 683 treesize of output 667 [2025-03-08 18:09:50,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 709 treesize of output 685 [2025-03-08 18:09:50,583 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 6 treesize of output 4 [2025-03-08 18:09:50,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 274 [2025-03-08 18:09:50,855 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 6 treesize of output 4 [2025-03-08 18:09:50,873 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 5 treesize of output 3 [2025-03-08 18:09:50,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:50,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 18:09:50,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:50,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 18:09:50,981 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:09:50,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:51,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:51,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 185 treesize of output 161 [2025-03-08 18:09:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:09:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486995968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:51,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 24, 16] total 44 [2025-03-08 18:09:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941320954] [2025-03-08 18:09:51,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:51,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 18:09:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:51,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 18:09:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1545, Unknown=48, NotChecked=162, Total=1892 [2025-03-08 18:09:51,421 INFO L87 Difference]: Start difference. First operand 226 states and 291 transitions. Second operand has 44 states, 40 states have (on average 3.85) internal successors, (154), 39 states have internal predecessors, (154), 14 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26)