./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_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_pop_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 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:09:56,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:09:56,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:09:56,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:09:56,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:09:56,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:09:56,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:09:56,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:09:56,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:09:56,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:09:56,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:09:56,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:09:56,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:09:56,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:09:56,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:09:56,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:09:56,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:09:56,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:09:56,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:09:56,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:09:56,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:09:56,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:09:56,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:09:56,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:09:56,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:09:56,687 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 -> 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 [2025-03-08 18:09:56,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:09:56,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:09:56,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:09:56,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:09:56,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:09:56,930 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_pop_back_harness.i [2025-03-08 18:09:58,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315f739cf/d10de6a9291448039a25726a9bb60eed/FLAGe9f44a2fd [2025-03-08 18:09:58,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:09:58,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-03-08 18:09:58,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315f739cf/d10de6a9291448039a25726a9bb60eed/FLAGe9f44a2fd [2025-03-08 18:09:58,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315f739cf/d10de6a9291448039a25726a9bb60eed [2025-03-08 18:09:58,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:09:58,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:09:58,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:58,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:09:58,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:09:58,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:58" (1/1) ... [2025-03-08 18:09:58,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbce5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:58, skipping insertion in model container [2025-03-08 18:09:58,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:58" (1/1) ... [2025-03-08 18:09:58,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:09:58,889 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_pop_back_harness.i[4498,4511] [2025-03-08 18:09:58,895 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_pop_back_harness.i[4558,4571] [2025-03-08 18:09:59,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,337 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,340 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,658 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_pop_back_harness.i[150656,150669] [2025-03-08 18:09:59,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:59,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:09:59,682 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_pop_back_harness.i[4498,4511] [2025-03-08 18:09:59,682 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_pop_back_harness.i[4558,4571] [2025-03-08 18:09:59,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,730 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,730 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,739 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,739 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,740 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,740 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:59,818 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_pop_back_harness.i[150656,150669] [2025-03-08 18:09:59,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:59,926 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:09:59,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59 WrapperNode [2025-03-08 18:09:59,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:59,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:59,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:09:59,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:09:59,931 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:09:59" (1/1) ... [2025-03-08 18:09:59,964 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:09:59" (1/1) ... [2025-03-08 18:09:59,997 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-03-08 18:09:59,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:59,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:09:59,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:09:59,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:10:00,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,040 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 36, 5]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 9 writes are split as follows [0, 9, 0]. [2025-03-08 18:10:00,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:10:00,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:10:00,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:10:00,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:10:00,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (1/1) ... [2025-03-08 18:10:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:00,097 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:00,099 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:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-08 18:10:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-03-08 18:10:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:10:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:10:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:00,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:00,120 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:10:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:10:00,333 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:10:00,334 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:10:00,379 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:00,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:10:00,488 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:00,663 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:10:00,667 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-08 18:10:00,705 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-08 18:10:00,705 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:10:00,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:10:00,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:10:00,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:00 BoogieIcfgContainer [2025-03-08 18:10:00,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:10:00,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:10:00,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:10:00,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:10:00,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:09:58" (1/3) ... [2025-03-08 18:10:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a3ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:00, skipping insertion in model container [2025-03-08 18:10:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:59" (2/3) ... [2025-03-08 18:10:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269a3ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:00, skipping insertion in model container [2025-03-08 18:10:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:00" (3/3) ... [2025-03-08 18:10:00,719 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2025-03-08 18:10:00,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:10:00,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_back_harness.i that has 13 procedures, 142 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-08 18:10:00,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:10:00,768 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;@2fa0555f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:10:00,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:10:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 18:10:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 18:10:00,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:00,778 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:00,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:00,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1741125493, now seen corresponding path program 1 times [2025-03-08 18:10:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875191223] [2025-03-08 18:10:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:00,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 18:10:00,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 18:10:00,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:00,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-08 18:10:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875191223] [2025-03-08 18:10:01,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875191223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956736281] [2025-03-08 18:10:01,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:01,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:01,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:01,631 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:01,633 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:01,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 18:10:01,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 18:10:01,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:01,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:01,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 18:10:01,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:01,983 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 16 treesize of output 17 [2025-03-08 18:10:01,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-08 18:10:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 81 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-08 18:10:04,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:16,907 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-08 18:10:16,907 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 2 case distinctions, treesize of input 82 treesize of output 88 [2025-03-08 18:10:16,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:16,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 104 [2025-03-08 18:10:16,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 29 treesize of output 27 [2025-03-08 18:10:16,976 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:10:17,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:17,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 18:10:17,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2025-03-08 18:10:17,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 77 [2025-03-08 18:10:17,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:17,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:17,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 126 treesize of output 118 [2025-03-08 18:10:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 18:10:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956736281] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:17,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:10:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 17] total 34 [2025-03-08 18:10:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655167721] [2025-03-08 18:10:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:17,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:10:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:17,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:10:17,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1012, Unknown=3, NotChecked=0, Total=1122 [2025-03-08 18:10:17,232 INFO L87 Difference]: Start difference. First operand has 134 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 18:10:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:17,868 INFO L93 Difference]: Finished difference Result 276 states and 418 transitions. [2025-03-08 18:10:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:10:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 118 [2025-03-08 18:10:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:17,874 INFO L225 Difference]: With dead ends: 276 [2025-03-08 18:10:17,874 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 18:10:17,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 192 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=125, Invalid=1204, Unknown=3, NotChecked=0, Total=1332 [2025-03-08 18:10:17,878 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 8 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:17,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1731 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:10:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 18:10:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 18:10:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 states have internal predecessors, (103), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 18:10:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-03-08 18:10:17,907 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 118 [2025-03-08 18:10:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-03-08 18:10:17,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-08 18:10:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-03-08 18:10:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 18:10:17,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:17,911 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:17,918 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:18,111 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:18,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:18,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 675155649, now seen corresponding path program 1 times [2025-03-08 18:10:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769687726] [2025-03-08 18:10:18,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:18,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 18:10:18,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 18:10:18,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:18,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 18:10:18,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769687726] [2025-03-08 18:10:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769687726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876449133] [2025-03-08 18:10:18,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:18,518 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:18,519 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:18,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 18:10:18,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 18:10:18,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:18,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:18,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 18:10:18,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:18,708 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 6 treesize of output 5 [2025-03-08 18:10:18,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:10:18,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:10:18,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 18:10:18,863 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 11 treesize of output 11 [2025-03-08 18:10:18,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:10:18,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:10:18,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 18:10:18,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-03-08 18:10:18,933 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2025-03-08 18:10:18,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-08 18:10:18,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:18,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 18:10:18,959 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 76 treesize of output 37 [2025-03-08 18:10:18,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-08 18:10:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 117 proven. 21 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 18:10:24,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:25,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:25,134 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 86 treesize of output 90 [2025-03-08 18:10:25,150 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:10:25,255 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:25,255 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:25,312 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:10:25,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 305 treesize of output 292 [2025-03-08 18:10:25,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:25,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:25,369 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:10:25,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 238 [2025-03-08 18:10:25,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:25,386 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 268 treesize of output 266 [2025-03-08 18:10:25,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:25,401 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 225 treesize of output 226 [2025-03-08 18:10:25,412 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 215 treesize of output 211 [2025-03-08 18:10:25,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:25,431 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 320 treesize of output 316 [2025-03-08 18:10:25,443 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 269 treesize of output 257 [2025-03-08 18:10:25,831 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:10:25,845 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:10:26,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:26,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:26,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:26,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 709 treesize of output 711 [2025-03-08 18:10:27,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:27,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 809 treesize of output 747 [2025-03-08 18:10:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876449133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:29,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:10:29,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2025-03-08 18:10:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365915782] [2025-03-08 18:10:29,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:10:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:10:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:29,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:10:29,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=565, Unknown=11, NotChecked=0, Total=650 [2025-03-08 18:10:29,230 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2025-03-08 18:10:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:31,217 INFO L93 Difference]: Finished difference Result 286 states and 386 transitions. [2025-03-08 18:10:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 18:10:31,218 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) Word has length 119 [2025-03-08 18:10:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:31,220 INFO L225 Difference]: With dead ends: 286 [2025-03-08 18:10:31,221 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 18:10:31,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 197 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=211, Invalid=1498, Unknown=13, NotChecked=0, Total=1722 [2025-03-08 18:10:31,224 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 229 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:31,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1536 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 18:10:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 18:10:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2025-03-08 18:10:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 115 states have internal predecessors, (146), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2025-03-08 18:10:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2025-03-08 18:10:31,243 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 119 [2025-03-08 18:10:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:31,243 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2025-03-08 18:10:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 8 states have call successors, (29) [2025-03-08 18:10:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2025-03-08 18:10:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 18:10:31,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:31,245 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:31,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:10:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 18:10:31,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -478763583, now seen corresponding path program 1 times [2025-03-08 18:10:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81649170] [2025-03-08 18:10:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:31,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 18:10:31,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 18:10:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-08 18:10:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81649170] [2025-03-08 18:10:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81649170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422312105] [2025-03-08 18:10:31,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:31,652 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:31,653 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:31,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 18:10:31,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 18:10:31,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:31,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:31,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 18:10:31,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 18:10:31,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422312105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-08 18:10:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879838379] [2025-03-08 18:10:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:31,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:10:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:31,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:10:31,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:10:31,878 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 18:10:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:32,133 INFO L93 Difference]: Finished difference Result 327 states and 435 transitions. [2025-03-08 18:10:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:10:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-03-08 18:10:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:32,135 INFO L225 Difference]: With dead ends: 327 [2025-03-08 18:10:32,135 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 18:10:32,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-08 18:10:32,136 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 202 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:32,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 880 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:10:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 18:10:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2025-03-08 18:10:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 115 states have internal predecessors, (144), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2025-03-08 18:10:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 221 transitions. [2025-03-08 18:10:32,162 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 221 transitions. Word has length 120 [2025-03-08 18:10:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:32,163 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 221 transitions. [2025-03-08 18:10:32,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 18:10:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 221 transitions. [2025-03-08 18:10:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 18:10:32,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:32,166 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:32,176 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:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:32,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1590446777, now seen corresponding path program 1 times [2025-03-08 18:10:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347565823] [2025-03-08 18:10:32,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 18:10:32,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 18:10:32,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:32,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-08 18:10:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347565823] [2025-03-08 18:10:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347565823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48324158] [2025-03-08 18:10:32,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:32,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:32,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:32,610 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:32,612 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:32,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 18:10:32,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 18:10:32,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:32,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:32,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 18:10:32,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 18:10:32,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48324158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:32,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-08 18:10:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844960189] [2025-03-08 18:10:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:32,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:10:32,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:32,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:10:32,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:10:32,864 INFO L87 Difference]: Start difference. First operand 167 states and 221 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 18:10:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:33,158 INFO L93 Difference]: Finished difference Result 339 states and 451 transitions. [2025-03-08 18:10:33,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:10:33,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 122 [2025-03-08 18:10:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:33,160 INFO L225 Difference]: With dead ends: 339 [2025-03-08 18:10:33,160 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 18:10:33,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-03-08 18:10:33,162 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 216 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:33,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 990 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:10:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 18:10:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2025-03-08 18:10:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 117 states have internal predecessors, (146), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2025-03-08 18:10:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2025-03-08 18:10:33,180 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 122 [2025-03-08 18:10:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:33,181 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2025-03-08 18:10:33,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 18:10:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2025-03-08 18:10:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 18:10:33,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:33,182 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:33,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:33,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1263824920, now seen corresponding path program 1 times [2025-03-08 18:10:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554885268] [2025-03-08 18:10:33,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:33,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 18:10:33,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 18:10:33,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:33,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-08 18:10:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554885268] [2025-03-08 18:10:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554885268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184903095] [2025-03-08 18:10:33,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:33,640 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:33,641 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:33,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 18:10:33,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 18:10:33,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:33,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:33,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 18:10:33,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 18:10:33,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184903095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:33,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 18:10:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097008126] [2025-03-08 18:10:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:33,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:10:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:33,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:10:33,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:10:33,799 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:10:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:33,824 INFO L93 Difference]: Finished difference Result 327 states and 438 transitions. [2025-03-08 18:10:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:10:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-08 18:10:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:33,826 INFO L225 Difference]: With dead ends: 327 [2025-03-08 18:10:33,826 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 18:10:33,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:10:33,827 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 337 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:10:33,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 337 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 18:10:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2025-03-08 18:10:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 117 states have (on average 1.264957264957265) internal successors, (148), 119 states have internal predecessors, (148), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2025-03-08 18:10:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2025-03-08 18:10:33,842 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 123 [2025-03-08 18:10:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:33,842 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2025-03-08 18:10:33,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:10:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2025-03-08 18:10:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 18:10:33,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:33,843 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:33,850 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:10:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:34,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -800716519, now seen corresponding path program 1 times [2025-03-08 18:10:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707626014] [2025-03-08 18:10:34,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:34,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 18:10:34,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 18:10:34,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:34,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-08 18:10:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707626014] [2025-03-08 18:10:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707626014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471723215] [2025-03-08 18:10:34,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:34,376 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:10:34,377 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:10:34,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 18:10:34,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 18:10:34,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:34,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:34,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 18:10:34,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 18:10:34,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471723215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 15 [2025-03-08 18:10:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310050445] [2025-03-08 18:10:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 18:10:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:34,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 18:10:34,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:10:34,670 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 18:10:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:35,026 INFO L93 Difference]: Finished difference Result 326 states and 427 transitions. [2025-03-08 18:10:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:10:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 131 [2025-03-08 18:10:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:35,028 INFO L225 Difference]: With dead ends: 326 [2025-03-08 18:10:35,028 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 18:10:35,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-03-08 18:10:35,029 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 172 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:35,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1287 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:10:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 18:10:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2025-03-08 18:10:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 120 states have internal predecessors, (149), 38 states have call successors, (38), 14 states have call predecessors, (38), 15 states have return successors, (39), 37 states have call predecessors, (39), 37 states have call successors, (39) [2025-03-08 18:10:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 226 transitions. [2025-03-08 18:10:35,049 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 226 transitions. Word has length 131 [2025-03-08 18:10:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:35,049 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 226 transitions. [2025-03-08 18:10:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 18:10:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 226 transitions. [2025-03-08 18:10:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 18:10:35,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:35,051 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:35,061 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:10:35,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:35,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1970160365, now seen corresponding path program 1 times [2025-03-08 18:10:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603103470] [2025-03-08 18:10:35,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:35,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:35,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 18:10:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603103470] [2025-03-08 18:10:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603103470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84580465] [2025-03-08 18:10:35,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:35,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:35,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:35,773 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:10:35,773 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:10:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:35,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:35,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:35,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:35,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 18:10:35,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:35,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:10:35,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:10:40,197 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2025-03-08 18:10:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 18:10:40,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-08 18:10:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84580465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:10:40,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:10:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 8] total 29 [2025-03-08 18:10:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619215034] [2025-03-08 18:10:40,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:10:40,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 18:10:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:40,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 18:10:40,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=677, Unknown=1, NotChecked=52, Total=812 [2025-03-08 18:10:40,500 INFO L87 Difference]: Start difference. First operand 172 states and 226 transitions. Second operand has 29 states, 27 states have (on average 4.703703703703703) internal successors, (127), 28 states have internal predecessors, (127), 11 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 18:10:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:41,640 INFO L93 Difference]: Finished difference Result 511 states and 724 transitions. [2025-03-08 18:10:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 18:10:41,640 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.703703703703703) internal successors, (127), 28 states have internal predecessors, (127), 11 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) Word has length 133 [2025-03-08 18:10:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:41,644 INFO L225 Difference]: With dead ends: 511 [2025-03-08 18:10:41,644 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 18:10:41,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=236, Invalid=2023, Unknown=1, NotChecked=92, Total=2352 [2025-03-08 18:10:41,646 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 235 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:41,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 2676 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1350 Invalid, 0 Unknown, 584 Unchecked, 0.8s Time] [2025-03-08 18:10:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 18:10:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 262. [2025-03-08 18:10:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 193 states have (on average 1.2953367875647668) internal successors, (250), 196 states have internal predecessors, (250), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (58), 48 states have call predecessors, (58), 48 states have call successors, (58) [2025-03-08 18:10:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 357 transitions. [2025-03-08 18:10:41,681 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 357 transitions. Word has length 133 [2025-03-08 18:10:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 357 transitions. [2025-03-08 18:10:41,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.703703703703703) internal successors, (127), 28 states have internal predecessors, (127), 11 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 18:10:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 357 transitions. [2025-03-08 18:10:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 18:10:41,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:41,683 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:41,691 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:10:41,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:41,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:41,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash -11959629, now seen corresponding path program 1 times [2025-03-08 18:10:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:41,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573323688] [2025-03-08 18:10:41,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:41,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:41,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:41,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 18:10:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573323688] [2025-03-08 18:10:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573323688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310925217] [2025-03-08 18:10:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:41,991 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:10:41,993 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:10:42,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:42,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:42,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:42,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:42,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:10:42,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 18:10:42,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:42,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310925217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:42,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 18:10:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652787584] [2025-03-08 18:10:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:42,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:42,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:42,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:42,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:42,173 INFO L87 Difference]: Start difference. First operand 262 states and 357 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:10:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:42,238 INFO L93 Difference]: Finished difference Result 509 states and 705 transitions. [2025-03-08 18:10:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-08 18:10:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:42,241 INFO L225 Difference]: With dead ends: 509 [2025-03-08 18:10:42,245 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 18:10:42,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 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:42,249 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 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:42,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 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:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 18:10:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2025-03-08 18:10:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 195 states have (on average 1.2717948717948717) internal successors, (248), 198 states have internal predecessors, (248), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (58), 48 states have call predecessors, (58), 48 states have call successors, (58) [2025-03-08 18:10:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2025-03-08 18:10:42,329 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 133 [2025-03-08 18:10:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:42,329 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2025-03-08 18:10:42,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:10:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2025-03-08 18:10:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 18:10:42,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:42,331 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:42,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:42,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 18:10:42,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:42,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:42,536 INFO L85 PathProgramCache]: Analyzing trace with hash 209072211, now seen corresponding path program 1 times [2025-03-08 18:10:42,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:42,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248558906] [2025-03-08 18:10:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:42,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:42,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:42,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:42,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-08 18:10:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248558906] [2025-03-08 18:10:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248558906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013805374] [2025-03-08 18:10:42,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:42,636 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:10:42,638 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:10:42,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 18:10:42,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 18:10:42,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:42,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:42,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:10:42,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 18:10:42,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013805374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 18:10:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583692176] [2025-03-08 18:10:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:42,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:10:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:42,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:10:42,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:10:42,860 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:10:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:42,887 INFO L93 Difference]: Finished difference Result 480 states and 651 transitions. [2025-03-08 18:10:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:10:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-08 18:10:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:42,890 INFO L225 Difference]: With dead ends: 480 [2025-03-08 18:10:42,890 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 18:10:42,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 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:42,893 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:42,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 18:10:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 218. [2025-03-08 18:10:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 157 states have (on average 1.2420382165605095) internal successors, (195), 159 states have internal predecessors, (195), 42 states have call successors, (42), 17 states have call predecessors, (42), 18 states have return successors, (46), 41 states have call predecessors, (46), 41 states have call successors, (46) [2025-03-08 18:10:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2025-03-08 18:10:42,918 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 133 [2025-03-08 18:10:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:42,918 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2025-03-08 18:10:42,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:10:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2025-03-08 18:10:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 18:10:42,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:42,919 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:42,927 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:10:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:43,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1740814082, now seen corresponding path program 1 times [2025-03-08 18:10:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459538276] [2025-03-08 18:10:43,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:43,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 18:10:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 18:10:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 18:10:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459538276] [2025-03-08 18:10:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459538276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:43,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691594602] [2025-03-08 18:10:43,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:43,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:43,351 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:10:43,352 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:10:43,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 18:10:43,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 18:10:43,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:43,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:43,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-08 18:10:43,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:43,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:43,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-03-08 18:10:43,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:43,662 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 21 treesize of output 1 [2025-03-08 18:10:43,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2025-03-08 18:10:43,716 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse0 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_9) .cse0) 24 .cse1) .cse2)))))) is different from true [2025-03-08 18:10:43,824 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse0 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_9) .cse0) 24 .cse1) .cse2)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse4 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_3) .cse3 v_arrayElimArr_10) .cse4) 24 .cse3) .cse5) (<= 2 .cse4))))))) is different from true [2025-03-08 18:10:43,984 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse0 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse1 v_arrayElimArr_11) .cse0) 24 .cse1) .cse2) (<= (+ .cse1 2) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse3 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= (+ 2 .cse4) .cse3) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_arrayElimArr_9) .cse3) 24 .cse4) .cse5)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse7 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) .cse6 v_arrayElimArr_10) .cse7) 24 .cse6) .cse8) (<= 2 .cse7))))))) is different from true [2025-03-08 18:10:44,199 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse0 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse1 v_arrayElimArr_11) .cse0) 24 .cse1) .cse2) (<= (+ .cse1 2) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse3 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= (+ 2 .cse4) .cse3) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_arrayElimArr_9) .cse3) 24 .cse4) .cse5)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse7 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) .cse6 v_arrayElimArr_10) .cse7) 24 .cse6) .cse8) (<= 2 .cse7)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse10 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse11 24))) (and (<= (+ 2 .cse9) .cse10) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_5) .cse9 v_arrayElimArr_12) .cse10) 24 .cse9)) (<= 2 .cse10))))))) is different from true [2025-03-08 18:10:44,439 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) .cse1 v_arrayElimArr_13) .cse0) 24 .cse1) .cse2) (<= 2 .cse0) (<= (+ 2 .cse1) .cse0)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse3 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_4) .cse4 v_arrayElimArr_11) .cse3) 24 .cse4) .cse5) (<= (+ .cse4 2) .cse3) (<= 2 .cse3)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse6 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (<= 2 .cse6) (<= (+ 2 .cse7) .cse6) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_9) .cse6) 24 .cse7) .cse8)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse11 24))) (and (<= (+ .cse9 2) .cse10) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_3) .cse9 v_arrayElimArr_10) .cse10) 24 .cse9) .cse11) (<= 2 .cse10)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse13 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse14 24))) (and (<= (+ 2 .cse12) .cse13) (= .cse14 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_5) .cse12 v_arrayElimArr_12) .cse13) 24 .cse12)) (<= 2 .cse13))))))) is different from true [2025-03-08 18:10:44,835 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21| Int) (v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ 2 .cse0) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) .cse0 v_arrayElimArr_14) .cse1) 24 .cse0) .cse2) (<= 2 .cse1)))))) (exists ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_6) .cse4 v_arrayElimArr_13) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_4) .cse7 v_arrayElimArr_11) .cse6) 24 .cse7) .cse8) (<= (+ .cse7 2) .cse6) (<= 2 .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse9 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (<= 2 .cse9) (<= (+ 2 .cse10) .cse9) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_1) .cse10 v_arrayElimArr_9) .cse9) 24 .cse10) .cse11)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse13 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse14 24))) (and (<= (+ .cse12 2) .cse13) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_3) .cse12 v_arrayElimArr_10) .cse13) 24 .cse12) .cse14) (<= 2 .cse13)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse16 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse15 (select .cse17 24))) (and (<= (+ 2 .cse15) .cse16) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_5) .cse15 v_arrayElimArr_12) .cse16) 24 .cse15)) (<= 2 .cse16))))))) is different from true [2025-03-08 18:10:45,211 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21| Int) (v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ 2 .cse0) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) .cse0 v_arrayElimArr_14) .cse1) 24 .cse0) .cse2) (<= 2 .cse1)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_22| Int) (v_arrayElimArr_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_22|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_8) .cse3 v_arrayElimArr_15) .cse4) 24 .cse3)) (<= 2 .cse4)))))) (exists ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_6) .cse7 v_arrayElimArr_13) .cse6) 24 .cse7) .cse8) (<= 2 .cse6) (<= (+ 2 .cse7) .cse6)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse9 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_4) .cse10 v_arrayElimArr_11) .cse9) 24 .cse10) .cse11) (<= (+ .cse10 2) .cse9) (<= 2 .cse9)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse12 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= (+ 2 .cse13) .cse12) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse12 v_DerPreprocessor_1) .cse13 v_arrayElimArr_9) .cse12) 24 .cse13) .cse14)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse15 (select .cse17 24))) (and (<= (+ .cse15 2) .cse16) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_3) .cse15 v_arrayElimArr_10) .cse16) 24 .cse15) .cse17) (<= 2 .cse16)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse19 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse20 (select |c_#memory_$Pointer$#1.base| .cse19))) (let ((.cse18 (select .cse20 24))) (and (<= (+ 2 .cse18) .cse19) (= .cse20 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse19 v_DerPreprocessor_5) .cse18 v_arrayElimArr_12) .cse19) 24 .cse18)) (<= 2 .cse19))))))) is different from true [2025-03-08 18:10:47,511 INFO L349 Elim1Store]: treesize reduction 416, result has 0.2 percent of original size [2025-03-08 18:10:47,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 587 treesize of output 1 [2025-03-08 18:10:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 76 not checked. [2025-03-08 18:10:47,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:10:48,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:49,086 INFO L349 Elim1Store]: treesize reduction 153, result has 52.3 percent of original size [2025-03-08 18:10:49,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1502 treesize of output 1152 [2025-03-08 18:10:49,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1927 treesize of output 1855 [2025-03-08 18:10:49,222 INFO L349 Elim1Store]: treesize reduction 26, result has 80.2 percent of original size [2025-03-08 18:10:49,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1017 treesize of output 1010 [2025-03-08 18:10:49,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:49,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 703 treesize of output 719 [2025-03-08 18:10:49,313 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 640 treesize of output 618 [2025-03-08 18:10:49,335 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 819 treesize of output 781 [2025-03-08 18:10:50,431 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:50,679 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:10:53,441 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:53,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:53,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2025-03-08 18:10:53,611 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:10:54,171 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:10:54,232 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:10:55,329 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 74 treesize of output 68 [2025-03-08 18:10:55,801 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 18:10:55,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 82 treesize of output 74 [2025-03-08 18:10:55,864 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:55,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2025-03-08 18:10:55,894 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 18:10:55,895 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 78 treesize of output 70 [2025-03-08 18:10:55,939 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:55,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2025-03-08 18:10:55,974 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:55,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:56,023 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2025-03-08 18:10:56,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,536 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-03-08 18:10:56,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 30 [2025-03-08 18:10:56,566 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:56,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2025-03-08 18:10:56,607 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:56,626 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:56,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:56,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2025-03-08 18:10:56,725 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2025-03-08 18:10:56,777 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 19 treesize of output 13 [2025-03-08 18:10:56,821 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:56,991 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:56,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2025-03-08 18:10:57,016 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:57,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:57,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:59,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:10:59,432 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:10:59,449 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:10:59,455 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:59,506 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 7 treesize of output 3 [2025-03-08 18:10:59,514 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:59,523 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:59,532 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 26 treesize of output 18 [2025-03-08 18:10:59,542 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,545 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 18:10:59,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 1 [2025-03-08 18:10:59,560 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:10:59,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,595 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-03-08 18:10:59,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2025-03-08 18:10:59,608 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:59,619 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:10:59,634 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:59,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 14 treesize of output 8 [2025-03-08 18:11:00,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:00,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 197 treesize of output 805 [2025-03-08 18:11:03,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:03,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 48 treesize of output 42 [2025-03-08 18:11:03,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:03,846 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:03,858 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-03-08 18:11:03,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 25 [2025-03-08 18:11:03,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:03,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:03,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 141 treesize of output 233 [2025-03-08 18:11:04,583 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:04,584 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:11:04,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:04,587 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-08 18:11:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-08 18:11:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691594602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:04,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:04,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 29, 18] total 50 [2025-03-08 18:11:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991689915] [2025-03-08 18:11:04,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 18:11:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 18:11:04,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1659, Unknown=24, NotChecked=616, Total=2450 [2025-03-08 18:11:04,756 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand has 50 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) [2025-03-08 18:11:05,210 WARN L873 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse0 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_9) .cse0) 24 .cse1) .cse2))))))) is different from true [2025-03-08 18:11:05,282 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse0 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_9) .cse0) 24 .cse1) .cse2)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-03-08 18:11:05,387 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse0 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= (+ 2 .cse1) .cse0) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_9) .cse0) 24 .cse1) .cse2)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse4 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse3 (select .cse5 24))) (and (<= (+ .cse3 2) .cse4) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_3) .cse3 v_arrayElimArr_10) .cse4) 24 .cse3) .cse5) (<= 2 .cse4)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-03-08 18:11:05,678 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse0 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse1 v_arrayElimArr_11) .cse0) 24 .cse1) .cse2) (<= (+ .cse1 2) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse3 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= (+ 2 .cse4) .cse3) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_arrayElimArr_9) .cse3) 24 .cse4) .cse5)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse7 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) .cse6 v_arrayElimArr_10) .cse7) 24 .cse6) .cse8) (<= 2 .cse7)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-03-08 18:11:05,851 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse0 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_4) .cse1 v_arrayElimArr_11) .cse0) 24 .cse1) .cse2) (<= (+ .cse1 2) .cse0) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse3 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= (+ 2 .cse4) .cse3) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse4 v_arrayElimArr_9) .cse3) 24 .cse4) .cse5)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse7 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse6 (select .cse8 24))) (and (<= (+ .cse6 2) .cse7) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) .cse6 v_arrayElimArr_10) .cse7) 24 .cse6) .cse8) (<= 2 .cse7)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse10 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse9 (select .cse11 24))) (and (<= (+ 2 .cse9) .cse10) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_5) .cse9 v_arrayElimArr_12) .cse10) 24 .cse9)) (<= 2 .cse10)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-03-08 18:11:07,024 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21| Int) (v_arrayElimArr_14 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_21|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 24))) (and (<= (+ 2 .cse0) .cse1) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_7) .cse0 v_arrayElimArr_14) .cse1) 24 .cse0) .cse2) (<= 2 .cse1)))))) (exists ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_6) .cse4 v_arrayElimArr_13) .cse3) 24 .cse4) .cse5) (<= 2 .cse3) (<= (+ 2 .cse4) .cse3)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_18|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_4) .cse7 v_arrayElimArr_11) .cse6) 24 .cse7) .cse8) (<= (+ .cse7 2) .cse6) (<= 2 .cse6)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16| Int)) (let ((.cse9 (select v_arrayElimArr_9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_16|))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (<= 2 .cse9) (<= (+ 2 .cse10) .cse9) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_1) .cse10 v_arrayElimArr_9) .cse9) 24 .cse10) .cse11)))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17| Int)) (let ((.cse13 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_17|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse12 (select .cse14 24))) (and (<= (+ .cse12 2) .cse13) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_3) .cse12 v_arrayElimArr_10) .cse13) 24 .cse12) .cse14) (<= 2 .cse13)))))) (exists ((v_arrayElimArr_12 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19| Int)) (let ((.cse16 (select v_arrayElimArr_12 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_19|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse15 (select .cse17 24))) (and (<= (+ 2 .cse15) .cse16) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_5) .cse15 v_arrayElimArr_12) .cse16) 24 .cse15)) (<= 2 .cse16)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-03-08 18:11:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:09,448 INFO L93 Difference]: Finished difference Result 487 states and 616 transitions. [2025-03-08 18:11:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 18:11:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) Word has length 134 [2025-03-08 18:11:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:09,450 INFO L225 Difference]: With dead ends: 487 [2025-03-08 18:11:09,450 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 18:11:09,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=297, Invalid=3848, Unknown=67, NotChecked=1794, Total=6006 [2025-03-08 18:11:09,452 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 33 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 2699 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:09,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3314 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2342 Invalid, 44 Unknown, 2699 Unchecked, 3.1s Time] [2025-03-08 18:11:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 18:11:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2025-03-08 18:11:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 176 states have (on average 1.2159090909090908) internal successors, (214), 178 states have internal predecessors, (214), 42 states have call successors, (42), 24 states have call predecessors, (42), 25 states have return successors, (46), 41 states have call predecessors, (46), 41 states have call successors, (46) [2025-03-08 18:11:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2025-03-08 18:11:09,477 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 134 [2025-03-08 18:11:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:09,477 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2025-03-08 18:11:09,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 19 states have call successors, (44), 11 states have call predecessors, (44), 15 states have return successors, (42), 17 states have call predecessors, (42), 19 states have call successors, (42) [2025-03-08 18:11:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2025-03-08 18:11:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 18:11:09,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:09,479 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:09,486 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:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 18:11:09,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:09,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1451216464, now seen corresponding path program 1 times [2025-03-08 18:11:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118901628] [2025-03-08 18:11:09,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 18:11:09,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 18:11:09,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:09,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 18:11:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118901628] [2025-03-08 18:11:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118901628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558323177] [2025-03-08 18:11:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:10,003 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:10,006 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:10,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 18:11:10,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 18:11:10,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:10,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:10,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-08 18:11:10,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:10,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:11:10,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:11:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 18:11:10,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 18:11:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558323177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:10,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:10,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 8] total 23 [2025-03-08 18:11:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935042092] [2025-03-08 18:11:10,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 18:11:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:10,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 18:11:10,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2025-03-08 18:11:10,674 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 21 states have internal predecessors, (112), 8 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-08 18:11:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:11,439 INFO L93 Difference]: Finished difference Result 489 states and 639 transitions. [2025-03-08 18:11:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 18:11:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 21 states have internal predecessors, (112), 8 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 156 [2025-03-08 18:11:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:11,441 INFO L225 Difference]: With dead ends: 489 [2025-03-08 18:11:11,441 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 18:11:11,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 18:11:11,443 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 111 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:11,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2474 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:11:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 18:11:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2025-03-08 18:11:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.2142857142857142) internal successors, (221), 185 states have internal predecessors, (221), 42 states have call successors, (42), 24 states have call predecessors, (42), 27 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2025-03-08 18:11:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 315 transitions. [2025-03-08 18:11:11,472 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 315 transitions. Word has length 156 [2025-03-08 18:11:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 315 transitions. [2025-03-08 18:11:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.090909090909091) internal successors, (112), 21 states have internal predecessors, (112), 8 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-08 18:11:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 315 transitions. [2025-03-08 18:11:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 18:11:11,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:11,473 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 18:11:11,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 18:11:11,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1458975823, now seen corresponding path program 1 times [2025-03-08 18:11:11,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:11,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294941580] [2025-03-08 18:11:11,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:11,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 18:11:11,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 18:11:11,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:11,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-08 18:11:11,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294941580] [2025-03-08 18:11:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294941580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481625672] [2025-03-08 18:11:11,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:11,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 18:11:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 18:11:12,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 18:11:12,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:12,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:12,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 18:11:12,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 18:11:12,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481625672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:12,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:12,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-08 18:11:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906616390] [2025-03-08 18:11:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:12,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:12,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:12,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:12,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:11:12,227 INFO L87 Difference]: Start difference. First operand 252 states and 315 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 18:11:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:12,321 INFO L93 Difference]: Finished difference Result 450 states and 572 transitions. [2025-03-08 18:11:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 18:11:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:12,323 INFO L225 Difference]: With dead ends: 450 [2025-03-08 18:11:12,323 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 18:11:12,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:11:12,324 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:12,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 942 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 18:11:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 250. [2025-03-08 18:11:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 181 states have (on average 1.2154696132596685) internal successors, (220), 183 states have internal predecessors, (220), 42 states have call successors, (42), 24 states have call predecessors, (42), 26 states have return successors, (50), 42 states have call predecessors, (50), 41 states have call successors, (50) [2025-03-08 18:11:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 312 transitions. [2025-03-08 18:11:12,349 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 312 transitions. Word has length 156 [2025-03-08 18:11:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:12,349 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 312 transitions. [2025-03-08 18:11:12,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 18:11:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 312 transitions. [2025-03-08 18:11:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 18:11:12,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:12,365 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-03-08 18:11:12,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 18:11:12,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 18:11:12,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash 95759202, now seen corresponding path program 1 times [2025-03-08 18:11:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426353483] [2025-03-08 18:11:12,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:12,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 18:11:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 18:11:12,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-08 18:11:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426353483] [2025-03-08 18:11:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426353483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269112976] [2025-03-08 18:11:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:13,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:13,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:13,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:13,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 18:11:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 18:11:14,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 18:11:14,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:14,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:14,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 18:11:14,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-08 18:11:14,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269112976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 25 [2025-03-08 18:11:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121530099] [2025-03-08 18:11:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 18:11:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:14,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 18:11:14,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2025-03-08 18:11:14,295 INFO L87 Difference]: Start difference. First operand 250 states and 312 transitions. Second operand has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 18:11:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:14,647 INFO L93 Difference]: Finished difference Result 449 states and 570 transitions. [2025-03-08 18:11:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:11:14,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 169 [2025-03-08 18:11:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:14,649 INFO L225 Difference]: With dead ends: 449 [2025-03-08 18:11:14,649 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 18:11:14,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 18:11:14,650 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 175 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:14,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1286 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:11:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 18:11:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2025-03-08 18:11:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 184 states have (on average 1.2119565217391304) internal successors, (223), 187 states have internal predecessors, (223), 42 states have call successors, (42), 24 states have call predecessors, (42), 27 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2025-03-08 18:11:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 317 transitions. [2025-03-08 18:11:14,684 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 317 transitions. Word has length 169 [2025-03-08 18:11:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:14,685 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 317 transitions. [2025-03-08 18:11:14,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 7 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 18:11:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 317 transitions. [2025-03-08 18:11:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 18:11:14,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:14,686 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:14,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 18:11:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 18:11:14,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2121816945, now seen corresponding path program 1 times [2025-03-08 18:11:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249293049] [2025-03-08 18:11:14,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 18:11:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 18:11:14,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 57 proven. 14 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-08 18:11:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249293049] [2025-03-08 18:11:15,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249293049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:15,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118170943] [2025-03-08 18:11:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:15,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:15,345 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:15,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 18:11:15,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 18:11:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 18:11:15,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:15,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 18:11:15,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:15,592 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 6 treesize of output 5 [2025-03-08 18:11:15,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 18:11:15,756 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 11 treesize of output 11 [2025-03-08 18:11:15,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:11:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:11:15,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:15,791 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 26 treesize of output 23 [2025-03-08 18:11:15,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-08 18:11:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 170 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:11:16,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 41 proven. 38 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-08 18:11:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118170943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:16,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 42 [2025-03-08 18:11:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8723722] [2025-03-08 18:11:16,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 18:11:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 18:11:16,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1606, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 18:11:16,821 INFO L87 Difference]: Start difference. First operand 254 states and 317 transitions. Second operand has 42 states, 38 states have (on average 4.868421052631579) internal successors, (185), 37 states have internal predecessors, (185), 16 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (47), 17 states have call predecessors, (47), 16 states have call successors, (47) [2025-03-08 18:11:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:19,405 INFO L93 Difference]: Finished difference Result 511 states and 664 transitions. [2025-03-08 18:11:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-08 18:11:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 4.868421052631579) internal successors, (185), 37 states have internal predecessors, (185), 16 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (47), 17 states have call predecessors, (47), 16 states have call successors, (47) Word has length 170 [2025-03-08 18:11:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:19,408 INFO L225 Difference]: With dead ends: 511 [2025-03-08 18:11:19,408 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 18:11:19,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 309 SyntacticMatches, 12 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=917, Invalid=9589, Unknown=0, NotChecked=0, Total=10506 [2025-03-08 18:11:19,411 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 498 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:19,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2496 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 18:11:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 18:11:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 268. [2025-03-08 18:11:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 197 states have (on average 1.233502538071066) internal successors, (243), 198 states have internal predecessors, (243), 42 states have call successors, (42), 24 states have call predecessors, (42), 28 states have return successors, (56), 45 states have call predecessors, (56), 41 states have call successors, (56) [2025-03-08 18:11:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2025-03-08 18:11:19,440 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 170 [2025-03-08 18:11:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:19,441 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2025-03-08 18:11:19,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 4.868421052631579) internal successors, (185), 37 states have internal predecessors, (185), 16 states have call successors, (48), 5 states have call predecessors, (48), 11 states have return successors, (47), 17 states have call predecessors, (47), 16 states have call successors, (47) [2025-03-08 18:11:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2025-03-08 18:11:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 18:11:19,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:19,442 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:19,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:19,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:19,642 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1546645088, now seen corresponding path program 1 times [2025-03-08 18:11:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042064812] [2025-03-08 18:11:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:19,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 18:11:19,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 18:11:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 18:11:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042064812] [2025-03-08 18:11:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042064812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261280342] [2025-03-08 18:11:19,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:19,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:19,796 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:19,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 18:11:19,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 18:11:20,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 18:11:20,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:20,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:20,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 18:11:20,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-08 18:11:20,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261280342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 18:11:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072323901] [2025-03-08 18:11:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:20,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:11:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:20,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:11:20,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:11:20,059 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 18:11:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:20,119 INFO L93 Difference]: Finished difference Result 483 states and 629 transitions. [2025-03-08 18:11:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:11:20,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 171 [2025-03-08 18:11:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:20,122 INFO L225 Difference]: With dead ends: 483 [2025-03-08 18:11:20,122 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 18:11:20,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:20,123 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 3 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:20,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 667 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 18:11:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2025-03-08 18:11:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 189 states have (on average 1.2063492063492063) internal successors, (228), 191 states have internal predecessors, (228), 42 states have call successors, (42), 24 states have call predecessors, (42), 27 states have return successors, (50), 43 states have call predecessors, (50), 41 states have call successors, (50) [2025-03-08 18:11:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2025-03-08 18:11:20,152 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 171 [2025-03-08 18:11:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:20,152 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2025-03-08 18:11:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 18:11:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2025-03-08 18:11:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 18:11:20,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:20,154 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:20,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:20,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 18:11:20,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:20,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2075274974, now seen corresponding path program 2 times [2025-03-08 18:11:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954554652] [2025-03-08 18:11:20,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:11:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:20,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-08 18:11:20,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 18:11:20,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:11:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 14 proven. 52 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-08 18:11:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954554652] [2025-03-08 18:11:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954554652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675878565] [2025-03-08 18:11:21,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:11:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:21,863 INFO L229 MonitoredProcess]: Starting monitored process 17 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:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 18:11:22,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-08 18:11:22,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 18:11:22,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:11:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:22,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 18:11:22,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:22,182 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 18:11:22,182 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:22,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 24 treesize of output 32 [2025-03-08 18:11:22,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 18:11:22,192 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 18 [2025-03-08 18:11:22,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:22,196 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