./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.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_push_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:10:24,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:10:24,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:10:24,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:10:24,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:10:24,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:10:24,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:10:24,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:10:24,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:10:24,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:10:24,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:10:24,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:10:24,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:10:24,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:24,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:10:24,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:10:24,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:10:24,493 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 -> 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 [2025-03-08 18:10:24,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:10:24,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:10:24,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:10:24,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:10:24,698 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:10:24,698 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_push_back_harness.i [2025-03-08 18:10:25,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e837073e/32716b725d414f92a07b99556e86e1f7/FLAG6acaa9fd8 [2025-03-08 18:10:26,313 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:10:26,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2025-03-08 18:10:26,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e837073e/32716b725d414f92a07b99556e86e1f7/FLAG6acaa9fd8 [2025-03-08 18:10:26,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e837073e/32716b725d414f92a07b99556e86e1f7 [2025-03-08 18:10:26,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:10:26,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:10:26,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:26,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:10:26,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:10:26,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:26" (1/1) ... [2025-03-08 18:10:26,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8b7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:26, skipping insertion in model container [2025-03-08 18:10:26,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:26" (1/1) ... [2025-03-08 18:10:26,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:10:26,620 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_push_back_harness.i[4499,4512] [2025-03-08 18:10:26,627 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_push_back_harness.i[4559,4572] [2025-03-08 18:10:27,078 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,079 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,079 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,080 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,080 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,090 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,090 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,091 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,092 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,093 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,093 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,094 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,390 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_push_back_harness.i[150688,150701] [2025-03-08 18:10:27,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:27,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:10:27,413 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_push_back_harness.i[4499,4512] [2025-03-08 18:10:27,414 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_push_back_harness.i[4559,4572] [2025-03-08 18:10:27,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,453 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:27,534 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_push_back_harness.i[150688,150701] [2025-03-08 18:10:27,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:27,680 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:10:27,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27 WrapperNode [2025-03-08 18:10:27,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:27,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:27,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:10:27,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:10:27,685 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:10:27" (1/1) ... [2025-03-08 18:10:27,747 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:10:27" (1/1) ... [2025-03-08 18:10:27,769 INFO L138 Inliner]: procedures = 668, calls = 1046, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 145 [2025-03-08 18:10:27,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:27,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:10:27,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:10:27,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:10:27,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,803 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 5, 28]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-03-08 18:10:27,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:10:27,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:10:27,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:10:27,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:10:27,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (1/1) ... [2025-03-08 18:10:27,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:27,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:27,871 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:10:27,873 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:10:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:10:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:10:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:10:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:10:27,893 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:10:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2025-03-08 18:10:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:10:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:10:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:10:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:27,894 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:10:27,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:10:28,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:10:28,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:10:28,100 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:10:28,114 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-03-08 18:10:28,121 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:10:28,268 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:10:28,303 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-08 18:10:28,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:10:28,314 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:10:28,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:10:28,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:28 BoogieIcfgContainer [2025-03-08 18:10:28,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:10:28,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:10:28,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:10:28,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:10:28,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:26" (1/3) ... [2025-03-08 18:10:28,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ffcee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:28, skipping insertion in model container [2025-03-08 18:10:28,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:27" (2/3) ... [2025-03-08 18:10:28,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ffcee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:28, skipping insertion in model container [2025-03-08 18:10:28,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:28" (3/3) ... [2025-03-08 18:10:28,323 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2025-03-08 18:10:28,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:10:28,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_push_back_harness.i that has 8 procedures, 101 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:10:28,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:10:28,390 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;@5304d757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:10:28,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:10:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 64 states have (on average 1.265625) internal successors, (81), 65 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 18:10:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:28,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:28,401 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:28,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1171475621, now seen corresponding path program 1 times [2025-03-08 18:10:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424268030] [2025-03-08 18:10:28,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:28,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:10:28,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:28,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424268030] [2025-03-08 18:10:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424268030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453950878] [2025-03-08 18:10:28,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:28,699 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:10:28,701 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:10:28,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:28,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:28,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:28,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:28,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:10:28,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:10:28,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453950878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:10:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735410133] [2025-03-08 18:10:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:28,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:10:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:28,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:10:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:10:28,928 INFO L87 Difference]: Start difference. First operand has 101 states, 64 states have (on average 1.265625) internal successors, (81), 65 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:28,958 INFO L93 Difference]: Finished difference Result 194 states and 282 transitions. [2025-03-08 18:10:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:10:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2025-03-08 18:10:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:28,974 INFO L225 Difference]: With dead ends: 194 [2025-03-08 18:10:28,975 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 18:10:28,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:10:28,982 INFO L435 NwaCegarLoop]: 135 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, 135 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:10:28,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 18:10:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 18:10:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 18:10:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2025-03-08 18:10:29,013 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 73 [2025-03-08 18:10:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:29,014 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2025-03-08 18:10:29,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2025-03-08 18:10:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:29,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:29,018 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:29,025 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:10:29,219 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:10:29,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:29,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 624241476, now seen corresponding path program 1 times [2025-03-08 18:10:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076114134] [2025-03-08 18:10:29,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:29,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:29,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:29,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076114134] [2025-03-08 18:10:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076114134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:10:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921595719] [2025-03-08 18:10:29,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:29,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:29,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:29,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:29,479 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:29,514 INFO L93 Difference]: Finished difference Result 183 states and 253 transitions. [2025-03-08 18:10:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2025-03-08 18:10:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:29,519 INFO L225 Difference]: With dead ends: 183 [2025-03-08 18:10:29,519 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 18:10:29,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:29,520 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:29,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 18:10:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 18:10:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 18:10:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2025-03-08 18:10:29,533 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2025-03-08 18:10:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:29,534 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2025-03-08 18:10:29,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2025-03-08 18:10:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:29,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:29,536 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:29,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:10:29,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash 383701347, now seen corresponding path program 1 times [2025-03-08 18:10:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877749701] [2025-03-08 18:10:29,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:29,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 18:10:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877749701] [2025-03-08 18:10:30,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877749701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139288495] [2025-03-08 18:10:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:30,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:30,080 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:10:30,081 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:10:30,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:30,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:30,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:30,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:30,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-08 18:10:30,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:30,318 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 10 treesize of output 8 [2025-03-08 18:10:30,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-08 18:10:30,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-03-08 18:10:30,451 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 8 treesize of output 1 [2025-03-08 18:10:31,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:31,399 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 216 treesize of output 188 [2025-03-08 18:10:31,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:31,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 85 [2025-03-08 18:10:31,410 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 60 treesize of output 52 [2025-03-08 18:10:31,412 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:10:31,419 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 53 treesize of output 47 [2025-03-08 18:10:31,422 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:10:31,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-08 18:10:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:10:32,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:36,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base)) (.cse1 (+ 8 c_aws_linked_list_insert_before_~before.offset))) (and (forall ((aws_linked_list_insert_before_~to_add.offset Int) (v_ArrVal_342 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse3 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse3 (+ aws_linked_list_insert_before_~to_add.offset 8) (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base .cse3) c_aws_linked_list_insert_before_~before.base) .cse1)))))) (store .cse2 (select (select .cse2 c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_342)))) (store .cse0 c_aws_linked_list_insert_before_~before.base (store (select .cse0 c_aws_linked_list_insert_before_~before.base) .cse1 c_aws_linked_list_insert_before_~to_add.base))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset) c_aws_linked_list_insert_before_~before.base)) (forall ((aws_linked_list_insert_before_~to_add.offset Int) (v_ArrVal_340 (Array Int Int))) (= c_aws_linked_list_insert_before_~before.offset (select (select (let ((.cse5 (let ((.cse7 (+ aws_linked_list_insert_before_~to_add.offset 8))) (store (store |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base (let ((.cse6 (store (select |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.offset))) (store .cse6 .cse7 (select (select (store |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base .cse6) c_aws_linked_list_insert_before_~before.base) .cse1)))) (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse8 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse8 .cse7 (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base .cse8) c_aws_linked_list_insert_before_~before.base) .cse1)))) c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_340)))) (store .cse5 c_aws_linked_list_insert_before_~before.base (store (select .cse5 c_aws_linked_list_insert_before_~before.base) .cse1 aws_linked_list_insert_before_~to_add.offset))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset))))) is different from false [2025-03-08 18:10:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139288495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:36,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:10:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2025-03-08 18:10:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243984878] [2025-03-08 18:10:36,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:10:36,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 18:10:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 18:10:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=910, Unknown=1, NotChecked=60, Total=1056 [2025-03-08 18:10:36,544 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 25 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 18:10:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:39,256 INFO L93 Difference]: Finished difference Result 333 states and 449 transitions. [2025-03-08 18:10:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 18:10:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 73 [2025-03-08 18:10:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:39,259 INFO L225 Difference]: With dead ends: 333 [2025-03-08 18:10:39,259 INFO L226 Difference]: Without dead ends: 239 [2025-03-08 18:10:39,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=263, Invalid=3046, Unknown=1, NotChecked=112, Total=3422 [2025-03-08 18:10:39,262 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 299 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:39,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 2027 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 18:10:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-08 18:10:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2025-03-08 18:10:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.261437908496732) internal successors, (193), 157 states have internal predecessors, (193), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 308 transitions. [2025-03-08 18:10:39,281 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 308 transitions. Word has length 73 [2025-03-08 18:10:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 308 transitions. [2025-03-08 18:10:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.590909090909091) internal successors, (79), 20 states have internal predecessors, (79), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-08 18:10:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 308 transitions. [2025-03-08 18:10:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:10:39,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:39,282 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:10:39,290 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:10:39,487 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,SelfDestructingSolverStorable2 [2025-03-08 18:10:39,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:39,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash -367753902, now seen corresponding path program 1 times [2025-03-08 18:10:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:39,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355814729] [2025-03-08 18:10:39,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:39,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:10:39,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:10:39,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:39,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:39,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355814729] [2025-03-08 18:10:39,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355814729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:39,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:39,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:10:39,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252309405] [2025-03-08 18:10:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:39,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:10:39,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:39,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:10:39,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:10:39,755 INFO L87 Difference]: Start difference. First operand 229 states and 308 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:39,851 INFO L93 Difference]: Finished difference Result 481 states and 656 transitions. [2025-03-08 18:10:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:10:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2025-03-08 18:10:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:39,854 INFO L225 Difference]: With dead ends: 481 [2025-03-08 18:10:39,854 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 18:10:39,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:10:39,855 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 29 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:39,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 553 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:10:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 18:10:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2025-03-08 18:10:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 177 states have (on average 1.2768361581920904) internal successors, (226), 181 states have internal predecessors, (226), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 341 transitions. [2025-03-08 18:10:39,883 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 341 transitions. Word has length 74 [2025-03-08 18:10:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:39,886 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 341 transitions. [2025-03-08 18:10:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 341 transitions. [2025-03-08 18:10:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:10:39,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:39,889 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:10:39,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:10:39,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 262704723, now seen corresponding path program 1 times [2025-03-08 18:10:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:39,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545746192] [2025-03-08 18:10:39,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:39,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:10:39,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:10:39,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:39,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545746192] [2025-03-08 18:10:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545746192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:10:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325595726] [2025-03-08 18:10:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:39,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:39,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:39,976 INFO L87 Difference]: Start difference. First operand 253 states and 341 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:40,001 INFO L93 Difference]: Finished difference Result 482 states and 658 transitions. [2025-03-08 18:10:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2025-03-08 18:10:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:40,004 INFO L225 Difference]: With dead ends: 482 [2025-03-08 18:10:40,004 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 18:10:40,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:40,005 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:40,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 18:10:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-03-08 18:10:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 177 states have (on average 1.2598870056497176) internal successors, (223), 181 states have internal predecessors, (223), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 338 transitions. [2025-03-08 18:10:40,027 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 338 transitions. Word has length 74 [2025-03-08 18:10:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:40,027 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 338 transitions. [2025-03-08 18:10:40,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 338 transitions. [2025-03-08 18:10:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:10:40,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:40,030 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:10:40,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:10:40,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:40,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 956097428, now seen corresponding path program 1 times [2025-03-08 18:10:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383732792] [2025-03-08 18:10:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:40,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:10:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:10:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383732792] [2025-03-08 18:10:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383732792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:10:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069906460] [2025-03-08 18:10:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:40,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:40,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:40,118 INFO L87 Difference]: Start difference. First operand 253 states and 338 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:40,143 INFO L93 Difference]: Finished difference Result 475 states and 641 transitions. [2025-03-08 18:10:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2025-03-08 18:10:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:40,145 INFO L225 Difference]: With dead ends: 475 [2025-03-08 18:10:40,145 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 18:10:40,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:40,146 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:40,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 375 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 18:10:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2025-03-08 18:10:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 165 states have internal predecessors, (196), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 311 transitions. [2025-03-08 18:10:40,166 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 311 transitions. Word has length 74 [2025-03-08 18:10:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 311 transitions. [2025-03-08 18:10:40,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 311 transitions. [2025-03-08 18:10:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:10:40,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:40,168 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1] [2025-03-08 18:10:40,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:10:40,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:40,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -180058550, now seen corresponding path program 1 times [2025-03-08 18:10:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136269901] [2025-03-08 18:10:40,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:40,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:10:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:10:40,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:40,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136269901] [2025-03-08 18:10:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136269901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 18:10:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497020767] [2025-03-08 18:10:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:40,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:10:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:40,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:10:40,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:10:40,412 INFO L87 Difference]: Start difference. First operand 237 states and 311 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:40,544 INFO L93 Difference]: Finished difference Result 483 states and 639 transitions. [2025-03-08 18:10:40,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:10:40,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2025-03-08 18:10:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:40,546 INFO L225 Difference]: With dead ends: 483 [2025-03-08 18:10:40,547 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 18:10:40,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:10:40,548 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 30 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:40,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 738 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:10:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 18:10:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2025-03-08 18:10:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 168 states have internal predecessors, (199), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 314 transitions. [2025-03-08 18:10:40,565 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 314 transitions. Word has length 76 [2025-03-08 18:10:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:40,565 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 314 transitions. [2025-03-08 18:10:40,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 314 transitions. [2025-03-08 18:10:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:10:40,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:40,566 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2025-03-08 18:10:40,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:10:40,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1387750375, now seen corresponding path program 1 times [2025-03-08 18:10:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503341110] [2025-03-08 18:10:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:10:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:10:40,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:40,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:10:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503341110] [2025-03-08 18:10:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503341110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:40,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:10:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360236818] [2025-03-08 18:10:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:40,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:10:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:40,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:10:40,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:10:40,796 INFO L87 Difference]: Start difference. First operand 240 states and 314 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:40,934 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2025-03-08 18:10:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:10:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2025-03-08 18:10:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:40,936 INFO L225 Difference]: With dead ends: 471 [2025-03-08 18:10:40,936 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 18:10:40,937 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:10:40,937 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 29 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:40,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 748 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:10:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 18:10:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 243. [2025-03-08 18:10:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 171 states have internal predecessors, (202), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-03-08 18:10:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 317 transitions. [2025-03-08 18:10:40,952 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 317 transitions. Word has length 77 [2025-03-08 18:10:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:40,952 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 317 transitions. [2025-03-08 18:10:40,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 317 transitions. [2025-03-08 18:10:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:10:40,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:40,953 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:40,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:10:40,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:40,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:40,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1742495738, now seen corresponding path program 1 times [2025-03-08 18:10:40,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:40,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554861823] [2025-03-08 18:10:40,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:40,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:10:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:10:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 18:10:41,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554861823] [2025-03-08 18:10:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554861823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189298843] [2025-03-08 18:10:41,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:41,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:41,363 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:10:41,365 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:10:41,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:10:41,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:10:41,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:41,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 18:10:41,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:42,294 INFO L349 Elim1Store]: treesize reduction 300, result has 32.6 percent of original size [2025-03-08 18:10:42,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 326 treesize of output 795 [2025-03-08 18:10:42,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 425 [2025-03-08 18:10:42,539 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 25 treesize of output 19 [2025-03-08 18:10:44,721 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,723 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,736 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,737 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,743 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:44,757 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-03-08 18:10:44,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3324 treesize of output 3299 [2025-03-08 18:10:45,891 INFO L349 Elim1Store]: treesize reduction 206, result has 9.3 percent of original size [2025-03-08 18:10:45,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 2179 treesize of output 2172 [2025-03-08 18:10:46,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:46,807 INFO L349 Elim1Store]: treesize reduction 174, result has 10.8 percent of original size [2025-03-08 18:10:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 1542 treesize of output 1465 [2025-03-08 18:10:47,253 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:47,254 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:10:47,270 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:47,270 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:10:47,288 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:47,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-08 18:10:51,253 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-08 18:10:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:51,454 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-08 18:10:51,460 INFO L158 Benchmark]: Toolchain (without parser) took 25100.36ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 98.8MB in the beginning and 449.5MB in the end (delta: -350.7MB). Peak memory consumption was 360.6MB. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1319.06ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 92.1MB in the end (delta: 6.7MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.30ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 87.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: Boogie Preprocessor took 68.62ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: IcfgBuilder took 475.72ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 52.7MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 18:10:51,460 INFO L158 Benchmark]: TraceAbstraction took 23143.05ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 52.7MB in the beginning and 449.5MB in the end (delta: -396.8MB). Peak memory consumption was 318.9MB. Max. memory is 16.1GB. [2025-03-08 18:10:51,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1319.06ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 92.1MB in the end (delta: 6.7MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.30ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 87.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.62ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 82.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 475.72ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 52.7MB in the end (delta: 30.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23143.05ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 52.7MB in the beginning and 449.5MB in the end (delta: -396.8MB). Peak memory consumption was 318.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-08 18:10:51,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_push_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:10:53,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:10:53,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 18:10:53,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:10:53,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:10:53,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:10:53,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:10:53,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:10:53,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:10:53,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:10:53,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:10:53,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:10:53,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:10:53,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:10:53,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:10:53,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:10:53,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:10:53,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:10:53,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:10:53,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:53,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:10:53,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:10:53,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:10:53,429 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 -> 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 [2025-03-08 18:10:53,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:10:53,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:10:53,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:10:53,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:10:53,672 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:10:53,672 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_push_back_harness.i [2025-03-08 18:10:54,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b334e73ab/951502e4e30e4f7abe8ed0f9ae2f5e1f/FLAG4591ce56d [2025-03-08 18:10:55,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:10:55,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2025-03-08 18:10:55,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b334e73ab/951502e4e30e4f7abe8ed0f9ae2f5e1f/FLAG4591ce56d [2025-03-08 18:10:55,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b334e73ab/951502e4e30e4f7abe8ed0f9ae2f5e1f [2025-03-08 18:10:55,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:10:55,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:10:55,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:55,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:10:55,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:10:55,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd954e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55, skipping insertion in model container [2025-03-08 18:10:55,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:10:55,598 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_push_back_harness.i[4499,4512] [2025-03-08 18:10:55,605 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_push_back_harness.i[4559,4572] [2025-03-08 18:10:55,941 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,011 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,012 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,013 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,032 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,033 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,034 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,034 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,038 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,038 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,041 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,051 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,056 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,056 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,056 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,057 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,058 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,058 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,058 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,059 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,059 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,059 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,059 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,060 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,274 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,274 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,350 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,366 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_push_back_harness.i[150688,150701] [2025-03-08 18:10:56,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:56,384 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 18:10:56,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:10:56,403 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_push_back_harness.i[4499,4512] [2025-03-08 18:10:56,403 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_push_back_harness.i[4559,4572] [2025-03-08 18:10:56,419 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,428 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,428 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,429 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,450 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,451 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,452 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,453 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,454 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,455 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,458 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,459 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,459 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,463 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,464 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,465 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,466 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,467 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,468 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,469 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,498 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,524 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:10:56,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_push_back_harness.i[150688,150701] [2025-03-08 18:10:56,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:56,533 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:10:56,544 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_push_back_harness.i[4499,4512] [2025-03-08 18:10:56,544 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_push_back_harness.i[4559,4572] [2025-03-08 18:10:56,569 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:56,655 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_push_back_harness.i[150688,150701] [2025-03-08 18:10:56,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:56,831 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:10:56,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56 WrapperNode [2025-03-08 18:10:56,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:56,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:56,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:10:56,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:10:56,837 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:10:56" (1/1) ... [2025-03-08 18:10:56,884 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:10:56" (1/1) ... [2025-03-08 18:10:56,911 INFO L138 Inliner]: procedures = 687, calls = 1046, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 146 [2025-03-08 18:10:56,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:56,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:10:56,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:10:56,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:10:56,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,944 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 5, 28]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-03-08 18:10:56,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:10:56,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:10:56,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:10:56,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:10:56,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (1/1) ... [2025-03-08 18:10:56,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:57,004 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:10:57,013 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:10:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:10:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 18:10:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 18:10:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 18:10:57,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:10:57,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:10:57,029 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:10:57,029 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2025-03-08 18:10:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2025-03-08 18:10:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:10:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:10:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:10:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:10:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:10:57,031 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:10:57,031 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:57,031 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:57,219 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:10:57,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:10:57,269 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem303.base, #t~mem303.offset;havoc #t~short304;havoc #t~mem305.base, #t~mem305.offset;havoc #t~mem306.base, #t~mem306.offset;havoc #t~short307; [2025-03-08 18:10:57,294 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-08 18:10:57,300 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:10:57,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret302#1; [2025-03-08 18:10:57,578 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-08 18:10:57,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:10:57,587 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:10:57,587 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:10:57,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:57 BoogieIcfgContainer [2025-03-08 18:10:57,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:10:57,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:10:57,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:10:57,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:10:57,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:55" (1/3) ... [2025-03-08 18:10:57,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@966f826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:57, skipping insertion in model container [2025-03-08 18:10:57,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:56" (2/3) ... [2025-03-08 18:10:57,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@966f826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:57, skipping insertion in model container [2025-03-08 18:10:57,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:57" (3/3) ... [2025-03-08 18:10:57,594 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2025-03-08 18:10:57,605 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:10:57,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_push_back_harness.i that has 8 procedures, 101 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:10:57,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:10:57,647 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;@4f306104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:10:57,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:10:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 64 states have (on average 1.265625) internal successors, (81), 65 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 18:10:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:57,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:57,656 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:57,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:57,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1171475621, now seen corresponding path program 1 times [2025-03-08 18:10:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789306459] [2025-03-08 18:10:57,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:57,671 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:10:57,672 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:10:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:57,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:57,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:10:57,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:10:57,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:57,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:10:57,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789306459] [2025-03-08 18:10:57,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789306459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:57,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:57,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 18:10:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665424114] [2025-03-08 18:10:57,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:57,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:10:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:10:57,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:10:57,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:10:57,900 INFO L87 Difference]: Start difference. First operand has 101 states, 64 states have (on average 1.265625) internal successors, (81), 65 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:57,919 INFO L93 Difference]: Finished difference Result 194 states and 282 transitions. [2025-03-08 18:10:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:10:57,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2025-03-08 18:10:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:57,924 INFO L225 Difference]: With dead ends: 194 [2025-03-08 18:10:57,925 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 18:10:57,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:10:57,929 INFO L435 NwaCegarLoop]: 135 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, 135 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:10:57,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 18:10:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-08 18:10:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 18:10:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2025-03-08 18:10:57,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 73 [2025-03-08 18:10:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:57,958 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2025-03-08 18:10:57,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2025-03-08 18:10:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:57,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:57,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:57,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:58,165 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 [2025-03-08 18:10:58,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 624241476, now seen corresponding path program 1 times [2025-03-08 18:10:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197822154] [2025-03-08 18:10:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:58,169 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:10:58,171 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:10:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:58,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:10:58,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:10:58,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:58,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:10:58,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197822154] [2025-03-08 18:10:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197822154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:10:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038286092] [2025-03-08 18:10:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:58,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:10:58,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:58,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:58,378 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:58,415 INFO L93 Difference]: Finished difference Result 183 states and 253 transitions. [2025-03-08 18:10:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2025-03-08 18:10:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:58,418 INFO L225 Difference]: With dead ends: 183 [2025-03-08 18:10:58,418 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 18:10:58,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:58,419 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:58,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 18:10:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 18:10:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 18:10:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2025-03-08 18:10:58,433 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2025-03-08 18:10:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:58,434 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2025-03-08 18:10:58,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:10:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2025-03-08 18:10:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:10:58,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:58,436 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:58,444 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:10:58,636 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 [2025-03-08 18:10:58,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:58,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 383701347, now seen corresponding path program 1 times [2025-03-08 18:10:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381997876] [2025-03-08 18:10:58,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:58,639 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:10:58,641 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:10:58,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:10:58,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:10:58,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:58,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:58,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 18:10:58,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:10:58,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:58,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:10:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381997876] [2025-03-08 18:10:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381997876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:58,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:58,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:10:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996081686] [2025-03-08 18:10:58,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:58,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:10:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:10:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:10:58,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:10:58,863 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:58,925 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2025-03-08 18:10:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:10:58,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2025-03-08 18:10:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:58,929 INFO L225 Difference]: With dead ends: 188 [2025-03-08 18:10:58,929 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 18:10:58,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:10:58,930 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:58,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 18:10:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 18:10:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.234375) internal successors, (79), 66 states have internal predecessors, (79), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2025-03-08 18:10:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2025-03-08 18:10:58,938 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 73 [2025-03-08 18:10:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:58,938 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2025-03-08 18:10:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2025-03-08 18:10:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:10:58,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:58,939 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-08 18:10:58,950 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:10:59,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:59,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:59,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2110564237, now seen corresponding path program 1 times [2025-03-08 18:10:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739579892] [2025-03-08 18:10:59,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:59,145 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:10:59,146 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:10:59,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:10:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:10:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:59,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:10:59,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:10:59,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:59,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:10:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739579892] [2025-03-08 18:10:59,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739579892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:59,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:59,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:10:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130486270] [2025-03-08 18:10:59,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:59,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:10:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:10:59,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:10:59,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:10:59,380 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:59,514 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2025-03-08 18:10:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:10:59,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2025-03-08 18:10:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:59,516 INFO L225 Difference]: With dead ends: 195 [2025-03-08 18:10:59,516 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 18:10:59,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 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:10:59,517 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:59,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 643 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:10:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 18:10:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-08 18:10:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2025-03-08 18:10:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2025-03-08 18:10:59,528 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 74 [2025-03-08 18:10:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:59,532 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2025-03-08 18:10:59,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:10:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2025-03-08 18:10:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:10:59,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:59,533 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:10:59,542 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:10:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:59,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1922868885, now seen corresponding path program 1 times [2025-03-08 18:10:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971114831] [2025-03-08 18:10:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:59,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:59,737 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:10:59,738 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:10:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:10:59,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:10:59,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:59,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 18:10:59,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:10:59,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:59,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:10:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971114831] [2025-03-08 18:10:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971114831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:10:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:10:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669743842] [2025-03-08 18:10:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:59,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:10:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:10:59,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:10:59,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:10:59,948 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:11:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:00,117 INFO L93 Difference]: Finished difference Result 201 states and 272 transitions. [2025-03-08 18:11:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:11:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2025-03-08 18:11:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:00,119 INFO L225 Difference]: With dead ends: 201 [2025-03-08 18:11:00,119 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 18:11:00,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:11:00,119 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 34 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:00,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 739 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 18:11:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-03-08 18:11:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2025-03-08 18:11:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-08 18:11:00,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 76 [2025-03-08 18:11:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:00,136 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-08 18:11:00,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:11:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-08 18:11:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:11:00,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:00,137 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:11:00,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:00,338 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 [2025-03-08 18:11:00,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1164406586, now seen corresponding path program 1 times [2025-03-08 18:11:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:00,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228741448] [2025-03-08 18:11:00,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:00,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:00,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:00,341 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:11:00,341 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:11:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:11:00,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:11:00,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:00,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:00,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 18:11:00,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:11:00,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:00,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:11:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228741448] [2025-03-08 18:11:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228741448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:00,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 18:11:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285172288] [2025-03-08 18:11:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:11:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:11:00,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:11:00,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:11:00,504 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:11:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:00,526 INFO L93 Difference]: Finished difference Result 196 states and 267 transitions. [2025-03-08 18:11:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:11:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2025-03-08 18:11:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:00,529 INFO L225 Difference]: With dead ends: 196 [2025-03-08 18:11:00,529 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 18:11:00,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 18:11:00,530 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:00,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 247 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 18:11:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-08 18:11:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2025-03-08 18:11:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2025-03-08 18:11:00,539 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 77 [2025-03-08 18:11:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-03-08 18:11:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:11:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2025-03-08 18:11:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:11:00,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:00,540 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:00,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 18:11:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:00,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash -314597, now seen corresponding path program 1 times [2025-03-08 18:11:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987655584] [2025-03-08 18:11:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:00,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:00,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:00,743 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:11:00,744 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:11:00,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:11:00,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:11:00,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:00,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:00,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 18:11:00,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:11:00,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:00,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:11:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987655584] [2025-03-08 18:11:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987655584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:00,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:00,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:11:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812982462] [2025-03-08 18:11:00,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:00,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:11:00,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:00,922 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:11:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:00,974 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2025-03-08 18:11:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-03-08 18:11:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:00,976 INFO L225 Difference]: With dead ends: 197 [2025-03-08 18:11:00,976 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 18:11:00,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:00,976 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:00,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 712 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 18:11:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-03-08 18:11:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2025-03-08 18:11:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2025-03-08 18:11:00,994 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 85 [2025-03-08 18:11:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2025-03-08 18:11:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 18:11:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2025-03-08 18:11:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:11:00,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:00,998 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:01,007 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:11:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:01,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1068852629, now seen corresponding path program 1 times [2025-03-08 18:11:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997640941] [2025-03-08 18:11:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:01,201 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:11:01,202 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:11:01,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:11:01,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:11:01,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:01,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:01,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 18:11:01,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:01,383 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 13 treesize of output 1 [2025-03-08 18:11:05,710 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2025-03-08 18:11:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:11:05,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 18:11:06,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:11:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997640941] [2025-03-08 18:11:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997640941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:06,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:11:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2025-03-08 18:11:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373915136] [2025-03-08 18:11:06,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:06,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:11:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:11:06,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:11:06,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2025-03-08 18:11:06,209 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 18:11:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:08,177 INFO L93 Difference]: Finished difference Result 244 states and 335 transitions. [2025-03-08 18:11:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 18:11:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 87 [2025-03-08 18:11:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:08,179 INFO L225 Difference]: With dead ends: 244 [2025-03-08 18:11:08,179 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 18:11:08,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2025-03-08 18:11:08,180 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:08,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1071 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 7 Unknown, 317 Unchecked, 1.8s Time] [2025-03-08 18:11:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 18:11:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2025-03-08 18:11:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 85 states have internal predecessors, (103), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2025-03-08 18:11:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2025-03-08 18:11:08,200 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 87 [2025-03-08 18:11:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:08,200 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2025-03-08 18:11:08,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 5 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-08 18:11:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2025-03-08 18:11:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:11:08,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:08,201 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:08,214 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:11:08,401 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 [2025-03-08 18:11:08,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash -601660940, now seen corresponding path program 1 times [2025-03-08 18:11:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576013786] [2025-03-08 18:11:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:08,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:08,404 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:11:08,405 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:11:08,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:11:08,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:11:08,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:08,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:11:08,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 18:11:08,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:08,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:11:08,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576013786] [2025-03-08 18:11:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576013786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:08,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:11:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185157238] [2025-03-08 18:11:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:08,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:11:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:11:08,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:11:08,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:11:08,572 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:11:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:08,595 INFO L93 Difference]: Finished difference Result 226 states and 308 transitions. [2025-03-08 18:11:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:11:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-08 18:11:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:08,598 INFO L225 Difference]: With dead ends: 226 [2025-03-08 18:11:08,598 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 18:11:08,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:11:08,599 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 18:11:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 18:11:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2025-03-08 18:11:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-03-08 18:11:08,608 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 87 [2025-03-08 18:11:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:08,608 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-03-08 18:11:08,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:11:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-03-08 18:11:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:11:08,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:08,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:08,617 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:11:08,813 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 [2025-03-08 18:11:08,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:08,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -581506992, now seen corresponding path program 1 times [2025-03-08 18:11:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539704482] [2025-03-08 18:11:08,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:08,815 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:11:08,817 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:11:08,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:11:08,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:11:08,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:08,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 18:11:08,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:08,974 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 10 treesize of output 8 [2025-03-08 18:11:09,130 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 18:11:09,130 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 1 case distinctions, treesize of input 14 treesize of output 15 [2025-03-08 18:11:10,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 126 [2025-03-08 18:11:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:10,697 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 18:11:10,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 81 [2025-03-08 18:11:10,732 INFO L349 Elim1Store]: treesize reduction 114, result has 7.3 percent of original size [2025-03-08 18:11:10,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 119 [2025-03-08 18:11:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-08 18:11:10,745 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:10,748 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 32 treesize of output 31 [2025-03-08 18:11:10,752 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 16 treesize of output 15 [2025-03-08 18:11:10,785 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-03-08 18:11:10,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 31 treesize of output 37 [2025-03-08 18:11:10,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:10,790 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 52 treesize of output 19 [2025-03-08 18:11:10,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:10,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 18:11:11,684 INFO L349 Elim1Store]: treesize reduction 93, result has 17.7 percent of original size [2025-03-08 18:11:11,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 185 treesize of output 114 [2025-03-08 18:11:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:11,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:12,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:12,664 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 2 case distinctions, treesize of input 115 treesize of output 108 [2025-03-08 18:11:12,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:12,688 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 344 treesize of output 342 [2025-03-08 18:11:12,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 323 [2025-03-08 18:11:12,726 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:11:12,755 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 186 treesize of output 180 [2025-03-08 18:11:15,279 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2025-03-08 18:11:15,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 10406 treesize of output 8282 [2025-03-08 18:11:15,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:15,436 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 1006 treesize of output 1000 [2025-03-08 18:11:15,464 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 1738 treesize of output 1626 [2025-03-08 18:11:16,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:16,410 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 1 case distinctions, treesize of input 7 treesize of output 6 [2025-03-08 18:11:16,494 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:11:16,498 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:11:16,543 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:11:16,551 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:11:16,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:16,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2025-03-08 18:11:16,921 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:11:16,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:16,935 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 44 treesize of output 44 [2025-03-08 18:11:16,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:16,965 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 622 treesize of output 582 [2025-03-08 18:11:17,032 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:11:17,083 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2025-03-08 18:11:17,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 71 [2025-03-08 18:11:22,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:22,108 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 1420 treesize of output 1348 [2025-03-08 18:11:22,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:22,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 7 treesize of output 6 [2025-03-08 18:11:22,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:22,193 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 36 treesize of output 40 [2025-03-08 18:11:22,234 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-03-08 18:11:22,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 1 [2025-03-08 18:11:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 18:11:22,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:11:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539704482] [2025-03-08 18:11:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539704482] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:22,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:22,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [19] total 32 [2025-03-08 18:11:22,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297086878] [2025-03-08 18:11:22,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:22,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 18:11:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:11:22,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 18:11:22,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-03-08 18:11:22,555 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-08 18:11:44,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:11:45,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:11:52,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 18:11:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:54,368 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2025-03-08 18:11:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 18:11:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2025-03-08 18:11:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:54,370 INFO L225 Difference]: With dead ends: 149 [2025-03-08 18:11:54,370 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 18:11:54,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 133 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 18:11:54,371 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 17 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:54,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1310 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 29.6s Time] [2025-03-08 18:11:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 18:11:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-03-08 18:11:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 92 states have internal predecessors, (106), 38 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (46), 35 states have call predecessors, (46), 37 states have call successors, (46) [2025-03-08 18:11:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-03-08 18:11:54,382 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 88 [2025-03-08 18:11:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:54,383 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-03-08 18:11:54,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-08 18:11:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-03-08 18:11:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 18:11:54,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:54,383 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:54,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 18:11:54,584 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 [2025-03-08 18:11:54,584 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1161303343, now seen corresponding path program 1 times [2025-03-08 18:11:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:11:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761049030] [2025-03-08 18:11:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:54,586 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:11:54,587 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:11:54,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 18:11:54,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 18:11:54,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:54,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 18:11:54,747 INFO L279 TraceCheckSpWp]: Computing forward predicates...