./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_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 14ecb1bdeb89e6f16cc91bd9d320557c2f2576024bfb946541efab4252b9f995 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:59,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:59,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:57:59,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:59,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:59,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:59,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:59,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:59,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:59,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:59,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:59,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:59,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:59,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:59,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:59,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:59,629 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 -> 14ecb1bdeb89e6f16cc91bd9d320557c2f2576024bfb946541efab4252b9f995 [2025-03-04 02:57:59,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:59,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:59,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:59,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:59,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:59,870 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_node_reset_harness.i [2025-03-04 02:58:01,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17da6296e/0e9eab184dc8458383794cff97618ed2/FLAG0122a48ad [2025-03-04 02:58:01,419 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:58:01,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness.i [2025-03-04 02:58:01,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17da6296e/0e9eab184dc8458383794cff97618ed2/FLAG0122a48ad [2025-03-04 02:58:01,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17da6296e/0e9eab184dc8458383794cff97618ed2 [2025-03-04 02:58:01,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:58:01,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:58:01,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:58:01,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:58:01,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:58:01,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:01" (1/1) ... [2025-03-04 02:58:01,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113dce1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:01, skipping insertion in model container [2025-03-04 02:58:01,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:58:01" (1/1) ... [2025-03-04 02:58:01,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:58:01,850 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_node_reset_harness.i[4500,4513] [2025-03-04 02:58:01,857 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_node_reset_harness.i[4560,4573] [2025-03-04 02:58:02,324 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,340 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,637 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_node_reset_harness.i[150268,150281] [2025-03-04 02:58:02,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:58:02,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:58:02,660 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_node_reset_harness.i[4500,4513] [2025-03-04 02:58:02,661 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_node_reset_harness.i[4560,4573] [2025-03-04 02:58:02,706 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,706 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,706 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,707 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,707 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,716 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,716 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,717 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,717 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,717 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:58:02,792 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_node_reset_harness.i[150268,150281] [2025-03-04 02:58:02,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:58:02,912 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:58:02,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02 WrapperNode [2025-03-04 02:58:02,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:58:02,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:58:02,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:58:02,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:58:02,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:02,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:02,996 INFO L138 Inliner]: procedures = 668, calls = 1032, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 27 [2025-03-04 02:58:02,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:58:02,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:58:02,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:58:02,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:58:03,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,015 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 02:58:03,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:58:03,040 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:58:03,040 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:58:03,040 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:58:03,041 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (1/1) ... [2025-03-04 02:58:03,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:58:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:03,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:58:03,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_reset [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_reset [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 02:58:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 02:58:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:58:03,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:58:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:58:03,259 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:58:03,261 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:58:03,413 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 02:58:03,413 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:58:03,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:58:03,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:58:03,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:03 BoogieIcfgContainer [2025-03-04 02:58:03,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:58:03,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:58:03,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:58:03,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:58:03,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:58:01" (1/3) ... [2025-03-04 02:58:03,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142cb97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:03, skipping insertion in model container [2025-03-04 02:58:03,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:58:02" (2/3) ... [2025-03-04 02:58:03,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142cb97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:58:03, skipping insertion in model container [2025-03-04 02:58:03,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:58:03" (3/3) ... [2025-03-04 02:58:03,426 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness.i [2025-03-04 02:58:03,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:58:03,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_node_reset_harness.i that has 8 procedures, 47 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 02:58:03,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:58:03,485 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;@3ebe6bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:58:03,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:58:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 02:58:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 02:58:03,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:03,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:03,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2002431561, now seen corresponding path program 1 times [2025-03-04 02:58:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023989838] [2025-03-04 02:58:03,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:03,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:58:03,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:58:03,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:03,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023989838] [2025-03-04 02:58:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023989838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:58:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:58:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626167534] [2025-03-04 02:58:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:03,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:58:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:03,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:58:03,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:58:03,729 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:58:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:03,745 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-03-04 02:58:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:58:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-04 02:58:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:03,750 INFO L225 Difference]: With dead ends: 71 [2025-03-04 02:58:03,750 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 02:58:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:58:03,754 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:03,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 02:58:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 02:58:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 02:58:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-04 02:58:03,782 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2025-03-04 02:58:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:03,783 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-04 02:58:03,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 02:58:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-04 02:58:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 02:58:03,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:03,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:03,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:58:03,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:03,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1630972579, now seen corresponding path program 1 times [2025-03-04 02:58:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794851520] [2025-03-04 02:58:03,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:03,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:58:03,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:58:03,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:03,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:04,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794851520] [2025-03-04 02:58:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794851520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:58:04,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:58:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507097986] [2025-03-04 02:58:04,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:04,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:58:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:58:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:58:04,183 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:58:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:04,227 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-04 02:58:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:58:04,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-04 02:58:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:04,229 INFO L225 Difference]: With dead ends: 44 [2025-03-04 02:58:04,229 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 02:58:04,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:58:04,230 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:04,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 171 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 02:58:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-04 02:58:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 02:58:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-04 02:58:04,243 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2025-03-04 02:58:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:04,244 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-04 02:58:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:58:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-04 02:58:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 02:58:04,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:04,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:04,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:58:04,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:04,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash -94916430, now seen corresponding path program 1 times [2025-03-04 02:58:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130890614] [2025-03-04 02:58:04,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:58:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:58:04,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130890614] [2025-03-04 02:58:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130890614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:58:04,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:58:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:58:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747797497] [2025-03-04 02:58:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:58:04,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:58:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:04,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:58:04,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:04,419 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:58:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:04,436 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-03-04 02:58:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:58:04,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-04 02:58:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:04,438 INFO L225 Difference]: With dead ends: 71 [2025-03-04 02:58:04,438 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 02:58:04,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:58:04,439 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:04,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 02:58:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 02:58:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 02:58:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-04 02:58:04,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-03-04 02:58:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:04,446 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-04 02:58:04,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:58:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-04 02:58:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 02:58:04,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:04,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:04,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:58:04,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1001525962, now seen corresponding path program 1 times [2025-03-04 02:58:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138032924] [2025-03-04 02:58:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:04,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:58:04,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:58:04,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:04,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:04,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:04,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138032924] [2025-03-04 02:58:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138032924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:04,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555531781] [2025-03-04 02:58:04,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:04,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:04,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:04,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:04,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:58:04,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:58:04,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:58:04,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:04,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 02:58:04,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:04,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:05,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:05,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 02:58:05,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 02:58:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555531781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:05,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 10] total 25 [2025-03-04 02:58:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653042508] [2025-03-04 02:58:05,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:05,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:58:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:05,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:58:05,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:58:05,600 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:06,191 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2025-03-04 02:58:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:58:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 27 [2025-03-04 02:58:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:06,192 INFO L225 Difference]: With dead ends: 76 [2025-03-04 02:58:06,192 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 02:58:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 02:58:06,194 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:06,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 303 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:58:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 02:58:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 02:58:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-04 02:58:06,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 27 [2025-03-04 02:58:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:06,208 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-04 02:58:06,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-03-04 02:58:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 02:58:06,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:06,209 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 02:58:06,217 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-04 02:58:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:06,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1095666095, now seen corresponding path program 1 times [2025-03-04 02:58:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535958236] [2025-03-04 02:58:06,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:58:06,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:58:06,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:06,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:58:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535958236] [2025-03-04 02:58:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535958236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996452100] [2025-03-04 02:58:06,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:58:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:06,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:06,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:58:06,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:58:06,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:58:06,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:06,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:06,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 02:58:06,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:06,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:06,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:07,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:07,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 02:58:07,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-04 02:58:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:07,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996452100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:07,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:07,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 13] total 32 [2025-03-04 02:58:07,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901823077] [2025-03-04 02:58:07,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:07,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 02:58:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:07,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 02:58:07,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:58:07,691 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:08,454 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-03-04 02:58:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:58:08,455 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 30 [2025-03-04 02:58:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:08,456 INFO L225 Difference]: With dead ends: 85 [2025-03-04 02:58:08,456 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 02:58:08,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=2137, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 02:58:08,457 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 70 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:08,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 419 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:58:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 02:58:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-03-04 02:58:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-04 02:58:08,463 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 30 [2025-03-04 02:58:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:08,463 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-04 02:58:08,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-04 02:58:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 02:58:08,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:08,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:08,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:08,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:08,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1199096504, now seen corresponding path program 2 times [2025-03-04 02:58:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956107637] [2025-03-04 02:58:08,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:08,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:58:08,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:58:08,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:08,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:58:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956107637] [2025-03-04 02:58:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956107637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53935272] [2025-03-04 02:58:08,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:08,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:08,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:08,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:58:08,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 02:58:08,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 02:58:08,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:08,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 02:58:08,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:08,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 02:58:08,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 02:58:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:09,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:10,135 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 45 treesize of output 41 [2025-03-04 02:58:10,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:10,141 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 45 treesize of output 37 [2025-03-04 02:58:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53935272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:10,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 13] total 29 [2025-03-04 02:58:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970039419] [2025-03-04 02:58:10,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:10,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:58:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:58:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:58:10,195 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:58:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:10,739 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2025-03-04 02:58:10,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:58:10,739 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2025-03-04 02:58:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:10,740 INFO L225 Difference]: With dead ends: 94 [2025-03-04 02:58:10,740 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 02:58:10,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:58:10,741 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:10,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 438 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 02:58:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 02:58:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-03-04 02:58:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-03-04 02:58:10,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 33 [2025-03-04 02:58:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:10,749 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-03-04 02:58:10,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 states have internal predecessors, (53), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:58:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-03-04 02:58:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 02:58:10,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:10,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-04 02:58:10,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:58:10,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:10,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:10,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -838915249, now seen corresponding path program 3 times [2025-03-04 02:58:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353788753] [2025-03-04 02:58:10,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:58:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:10,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-04 02:58:10,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-04 02:58:10,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:58:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:58:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353788753] [2025-03-04 02:58:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353788753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777855571] [2025-03-04 02:58:11,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:58:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:11,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:11,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:58:11,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-04 02:58:11,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-04 02:58:11,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:58:11,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:11,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 02:58:11,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:11,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:11,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:11,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:58:11,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:11,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:58:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:58:11,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777855571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:11,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:58:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-04 02:58:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14965458] [2025-03-04 02:58:11,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:58:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:11,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:58:11,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:58:11,553 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:58:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:11,648 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2025-03-04 02:58:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:58:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-04 02:58:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:11,650 INFO L225 Difference]: With dead ends: 91 [2025-03-04 02:58:11,652 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 02:58:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:58:11,653 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:58:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 02:58:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 02:58:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 40 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 02:58:11,663 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 36 [2025-03-04 02:58:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:11,663 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 02:58:11,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:58:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 02:58:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 02:58:11,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:11,664 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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] [2025-03-04 02:58:11,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:58:11,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:11,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:11,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash 683134823, now seen corresponding path program 4 times [2025-03-04 02:58:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:11,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125960069] [2025-03-04 02:58:11,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:58:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:11,876 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 02:58:11,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:58:11,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:58:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:58:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125960069] [2025-03-04 02:58:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125960069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188734896] [2025-03-04 02:58:12,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:58:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:12,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:58:12,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-04 02:58:12,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:58:12,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:58:12,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:12,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 02:58:12,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:12,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:12,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:12,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:12,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:58:12,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:58:12,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:12,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 02:58:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:13,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:13,846 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 40 treesize of output 38 [2025-03-04 02:58:13,849 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 58 treesize of output 54 [2025-03-04 02:58:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188734896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:13,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 17] total 43 [2025-03-04 02:58:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980891735] [2025-03-04 02:58:13,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 02:58:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:13,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 02:58:13,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 02:58:13,917 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 40 states have internal predecessors, (71), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:15,128 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2025-03-04 02:58:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:58:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 40 states have internal predecessors, (71), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 37 [2025-03-04 02:58:15,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:15,129 INFO L225 Difference]: With dead ends: 102 [2025-03-04 02:58:15,129 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 02:58:15,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=3801, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 02:58:15,130 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:15,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 519 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 02:58:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 02:58:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-03-04 02:58:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-04 02:58:15,141 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 37 [2025-03-04 02:58:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-04 02:58:15,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 40 states have internal predecessors, (71), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-04 02:58:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 02:58:15,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:15,142 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:15,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:58:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:15,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:15,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1591935570, now seen corresponding path program 5 times [2025-03-04 02:58:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737585179] [2025-03-04 02:58:15,343 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:58:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:15,362 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 5 equivalence classes. [2025-03-04 02:58:15,440 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:58:15,441 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 02:58:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 02:58:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737585179] [2025-03-04 02:58:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737585179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192274041] [2025-03-04 02:58:15,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:58:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:15,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:15,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:58:15,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 5 equivalence classes. [2025-03-04 02:58:16,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 02:58:16,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 02:58:16,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:16,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 02:58:16,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:16,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:16,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:16,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:16,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:58:16,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:16,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:58:16,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:16,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 02:58:16,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:16,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 65 [2025-03-04 02:58:20,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 Int) (v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_22 Int)) (let ((.cse1 (select |c_#memory_int#2| v_aws_linked_list_node_reset_~node.base_BEFORE_CALL_22))) (let ((.cse0 (select .cse1 (+ 5 v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)))) (and (= .cse0 (select .cse1 (+ 2 v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))) (= (select .cse1 (+ v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16 1)) .cse0) (= (select .cse1 v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16) .cse0) (= (select .cse1 (+ 4 v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16)) .cse0) (= .cse0 (select .cse1 (+ 3 v_aws_linked_list_node_reset_~node.offset_BEFORE_CALL_16))))))) is different from true [2025-03-04 02:58:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:21,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:22,915 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 93 treesize of output 89 [2025-03-04 02:58:22,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:22,921 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 2023 treesize of output 2015 [2025-03-04 02:58:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192274041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:23,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 18] total 42 [2025-03-04 02:58:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503298145] [2025-03-04 02:58:23,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:23,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 02:58:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:23,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 02:58:23,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1498, Unknown=1, NotChecked=78, Total=1722 [2025-03-04 02:58:23,135 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:58:28,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:58:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:29,985 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2025-03-04 02:58:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 02:58:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2025-03-04 02:58:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:29,987 INFO L225 Difference]: With dead ends: 109 [2025-03-04 02:58:29,987 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 02:58:29,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=223, Invalid=2230, Unknown=1, NotChecked=96, Total=2550 [2025-03-04 02:58:29,988 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:29,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 828 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 968 Invalid, 1 Unknown, 77 Unchecked, 6.1s Time] [2025-03-04 02:58:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 02:58:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2025-03-04 02:58:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 46 states have internal predecessors, (57), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-04 02:58:30,008 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 40 [2025-03-04 02:58:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:30,009 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-04 02:58:30,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 02:58:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-04 02:58:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:58:30,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:30,012 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:30,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:58:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:30,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 609428325, now seen corresponding path program 6 times [2025-03-04 02:58:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135942803] [2025-03-04 02:58:30,214 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:58:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:30,234 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 6 equivalence classes. [2025-03-04 02:58:30,297 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:58:30,297 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 02:58:30,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:58:30,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135942803] [2025-03-04 02:58:30,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135942803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702289565] [2025-03-04 02:58:30,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:58:30,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:30,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:30,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:58:30,599 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 6 equivalence classes. [2025-03-04 02:58:30,978 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:58:30,978 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-04 02:58:30,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:30,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 02:58:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:31,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 02:58:31,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 02:58:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 02:58:31,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:31,903 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 16 treesize of output 14 [2025-03-04 02:58:31,905 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 18 treesize of output 14 [2025-03-04 02:58:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702289565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:32,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 20] total 37 [2025-03-04 02:58:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772455830] [2025-03-04 02:58:32,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 02:58:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:32,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 02:58:32,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 02:58:32,078 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 37 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 states have internal predecessors, (66), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:58:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:34,364 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2025-03-04 02:58:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 02:58:34,365 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 states have internal predecessors, (66), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-03-04 02:58:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:34,365 INFO L225 Difference]: With dead ends: 122 [2025-03-04 02:58:34,365 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 02:58:34,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=1542, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 02:58:34,366 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 665 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 02:58:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 02:58:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2025-03-04 02:58:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 49 states have internal predecessors, (62), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-03-04 02:58:34,383 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 43 [2025-03-04 02:58:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:34,383 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-03-04 02:58:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 37 states have internal predecessors, (66), 3 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 02:58:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-03-04 02:58:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 02:58:34,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:34,385 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:34,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:58:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:34,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -168428500, now seen corresponding path program 7 times [2025-03-04 02:58:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:34,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725061221] [2025-03-04 02:58:34,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:58:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:34,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 02:58:34,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 02:58:34,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:34,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 02:58:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:34,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725061221] [2025-03-04 02:58:34,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725061221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:34,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265496179] [2025-03-04 02:58:34,906 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:58:34,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:34,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:34,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:34,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:58:34,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 02:58:35,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 02:58:35,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:58:35,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:35,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-04 02:58:35,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:35,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:35,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:35,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:58:35,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:58:35,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 02:58:35,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 02:58:35,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 02:58:35,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:35,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 02:58:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:36,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:39,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2025-03-04 02:58:39,435 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 85 treesize of output 81 [2025-03-04 02:58:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265496179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:39,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 24] total 60 [2025-03-04 02:58:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837833375] [2025-03-04 02:58:39,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-04 02:58:39,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:39,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-04 02:58:39,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3262, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 02:58:39,557 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 60 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 57 states have internal predecessors, (92), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:42,429 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2025-03-04 02:58:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 02:58:42,429 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 57 states have internal predecessors, (92), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2025-03-04 02:58:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:42,430 INFO L225 Difference]: With dead ends: 123 [2025-03-04 02:58:42,430 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 02:58:42,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=534, Invalid=7122, Unknown=0, NotChecked=0, Total=7656 [2025-03-04 02:58:42,432 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 116 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:42,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 991 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 02:58:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 02:58:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2025-03-04 02:58:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 52 states have internal predecessors, (67), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-04 02:58:42,448 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 46 [2025-03-04 02:58:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-04 02:58:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 57 states have internal predecessors, (92), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-04 02:58:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-04 02:58:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 02:58:42,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:42,448 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:42,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 02:58:42,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:58:42,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 365856867, now seen corresponding path program 8 times [2025-03-04 02:58:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936296427] [2025-03-04 02:58:42,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:42,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:58:42,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:58:42,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:42,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 02:58:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936296427] [2025-03-04 02:58:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936296427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028547480] [2025-03-04 02:58:43,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:58:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:43,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:43,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:58:43,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 02:58:43,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:58:43,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:58:43,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:43,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 02:58:43,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 02:58:43,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:58:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 02:58:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028547480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:58:43,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:58:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-03-04 02:58:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156634909] [2025-03-04 02:58:43,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:58:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:58:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:58:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:58:43,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:58:43,871 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:58:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:58:44,515 INFO L93 Difference]: Finished difference Result 120 states and 164 transitions. [2025-03-04 02:58:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:58:44,516 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-03-04 02:58:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:58:44,517 INFO L225 Difference]: With dead ends: 120 [2025-03-04 02:58:44,517 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 02:58:44,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 02:58:44,518 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:58:44,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:58:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 02:58:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 02:58:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 59 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 02:58:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-03-04 02:58:44,544 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 49 [2025-03-04 02:58:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:58:44,544 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-03-04 02:58:44,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:58:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-03-04 02:58:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 02:58:44,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:58:44,545 INFO L218 NwaCegarLoop]: trace histogram [16, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:58:44,552 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-04 02:58:44,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:44,746 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:58:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:58:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash -649669557, now seen corresponding path program 9 times [2025-03-04 02:58:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:58:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626561150] [2025-03-04 02:58:44,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:58:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:58:44,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 9 equivalence classes. [2025-03-04 02:58:44,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:58:44,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 02:58:44,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 22 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:58:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626561150] [2025-03-04 02:58:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626561150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:58:47,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87910646] [2025-03-04 02:58:47,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:58:47,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:58:47,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:58:47,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:58:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:58:47,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 9 equivalence classes. [2025-03-04 02:58:51,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:58:51,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 02:58:51,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:58:51,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-03-04 02:58:51,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:58:51,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:58:51,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 02:58:51,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 02:58:51,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 02:58:51,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-03-04 02:58:51,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-04 02:58:51,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-03-04 02:58:51,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-03-04 02:58:51,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-03-04 02:58:51,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:51,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-03-04 02:58:52,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-03-04 02:58:52,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2025-03-04 02:58:52,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 120 treesize of output 152 [2025-03-04 02:58:52,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 164 [2025-03-04 02:58:52,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 138 treesize of output 176 [2025-03-04 02:58:52,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:58:52,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 147 treesize of output 188 [2025-03-04 02:58:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:58:55,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:13,587 WARN L286 SmtUtils]: Spent 16.42s on a formula simplification. DAG size of input: 188 DAG size of output: 186 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-04 02:59:17,118 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 106 treesize of output 104 [2025-03-04 02:59:17,123 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 185 treesize of output 181 [2025-03-04 02:59:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:59:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87910646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:17,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37, 33] total 100 [2025-03-04 02:59:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982870326] [2025-03-04 02:59:17,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:17,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-04 02:59:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:17,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-04 02:59:17,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=9191, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 02:59:17,305 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 10 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9)