./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:50:43,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:50:43,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:50:43,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:50:43,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:50:43,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:50:43,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:50:43,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:50:43,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:50:43,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:50:43,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:50:43,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:50:43,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:50:43,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:50:43,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:50:43,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:50:43,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:50:43,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:50:43,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:50:43,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:50:43,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:50:43,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:50:43,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:50:43,118 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 [2025-03-08 05:50:43,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:50:43,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:50:43,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:50:43,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:50:43,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:50:43,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2025-03-08 05:50:44,456 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56adf1f4/5c8fcb554eb64796bf7979c39c8d4e4e/FLAG52105a743 [2025-03-08 05:50:44,738 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:50:44,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2025-03-08 05:50:44,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56adf1f4/5c8fcb554eb64796bf7979c39c8d4e4e/FLAG52105a743 [2025-03-08 05:50:45,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56adf1f4/5c8fcb554eb64796bf7979c39c8d4e4e [2025-03-08 05:50:45,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:50:45,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:50:45,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:50:45,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:50:45,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:50:45,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556fcdc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45, skipping insertion in model container [2025-03-08 05:50:45,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:50:45,141 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/recursified_nla-digbench/recursified_lcm2.c[1061,1074] [2025-03-08 05:50:45,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:50:45,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:50:45,177 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/recursified_nla-digbench/recursified_lcm2.c[1061,1074] [2025-03-08 05:50:45,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:50:45,200 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:50:45,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45 WrapperNode [2025-03-08 05:50:45,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:50:45,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:50:45,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:50:45,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:50:45,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,232 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2025-03-08 05:50:45,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:50:45,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:50:45,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:50:45,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:50:45,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,260 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 7, 7, 7, 6, 6, 8, 8]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 1, 1, 2, 2, 2, 2]. [2025-03-08 05:50:45,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:50:45,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:50:45,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:50:45,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:50:45,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (1/1) ... [2025-03-08 05:50:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:50:45,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:50:45,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:50:45,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:50:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:50:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:50:45,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 05:50:45,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:50:45,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 05:50:45,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 05:50:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 05:50:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 05:50:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:50:45,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:50:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:50:45,324 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2025-03-08 05:50:45,324 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2025-03-08 05:50:45,390 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:50:45,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:50:45,494 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#u~0#1.base, main_~#u~0#1.offset);havoc main_~#u~0#1.base, main_~#u~0#1.offset;call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~0#1.offset; [2025-03-08 05:50:45,549 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 05:50:45,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:50:45,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:50:45,556 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:50:45,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:50:45 BoogieIcfgContainer [2025-03-08 05:50:45,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:50:45,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:50:45,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:50:45,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:50:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:50:45" (1/3) ... [2025-03-08 05:50:45,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711642e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:50:45, skipping insertion in model container [2025-03-08 05:50:45,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:50:45" (2/3) ... [2025-03-08 05:50:45,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711642e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:50:45, skipping insertion in model container [2025-03-08 05:50:45,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:50:45" (3/3) ... [2025-03-08 05:50:45,563 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2025-03-08 05:50:45,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:50:45,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_lcm2.c that has 4 procedures, 36 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:50:45,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:50:45,617 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;@16cf853e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:50:45,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:50:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 05:50:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:50:45,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:50:45,626 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:50:45,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:50:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:50:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash 771020995, now seen corresponding path program 1 times [2025-03-08 05:50:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:50:45,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608343114] [2025-03-08 05:50:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:50:45,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:50:45,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:50:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:50:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:50:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:50:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608343114] [2025-03-08 05:50:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608343114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:50:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521427444] [2025-03-08 05:50:45,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:45,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:50:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:50:45,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:50:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:50:45,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:50:45,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:50:45,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:45,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:50:45,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:50:45,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:50:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:50:45,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:50:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521427444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:50:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:50:45,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 05:50:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057891430] [2025-03-08 05:50:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:50:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:50:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:50:45,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:50:45,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:50:45,951 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:50:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:50:45,963 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2025-03-08 05:50:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:50:45,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-08 05:50:45,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:50:45,968 INFO L225 Difference]: With dead ends: 69 [2025-03-08 05:50:45,968 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 05:50:45,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:50:45,972 INFO L435 NwaCegarLoop]: 42 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, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:50:45,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:50:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 05:50:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 05:50:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:50:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-08 05:50:45,995 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 33 [2025-03-08 05:50:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:50:45,996 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-08 05:50:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:50:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-08 05:50:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:50:45,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:50:45,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:50:46,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:50:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:50:46,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:50:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:50:46,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2029721785, now seen corresponding path program 1 times [2025-03-08 05:50:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:50:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472618066] [2025-03-08 05:50:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:50:46,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:50:46,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:50:46,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:46,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:50:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819516080] [2025-03-08 05:50:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:50:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:50:46,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:50:46,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:50:46,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:50:46,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:50:46,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:46,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:50:46,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-08 05:50:46,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:50:46,621 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 15 treesize of output 1 [2025-03-08 05:50:46,622 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 15 treesize of output 1 [2025-03-08 05:50:46,637 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 15 treesize of output 11 [2025-03-08 05:50:46,645 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 15 treesize of output 11 [2025-03-08 05:50:46,651 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 15 treesize of output 11 [2025-03-08 05:50:46,657 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 15 treesize of output 11 [2025-03-08 05:50:46,766 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 30 treesize of output 18 [2025-03-08 05:50:46,773 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 19 treesize of output 11 [2025-03-08 05:50:46,776 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 10 [2025-03-08 05:50:46,785 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 30 treesize of output 18 [2025-03-08 05:50:46,792 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 15 treesize of output 7 [2025-03-08 05:50:46,798 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 15 treesize of output 7 [2025-03-08 05:50:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:50:46,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:50:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:50:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472618066] [2025-03-08 05:50:46,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:50:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819516080] [2025-03-08 05:50:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819516080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:50:46,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:50:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:50:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323228788] [2025-03-08 05:50:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:50:46,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:50:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:50:46,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:50:46,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:50:46,850 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:50:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:50:47,081 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-03-08 05:50:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:50:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-03-08 05:50:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:50:47,083 INFO L225 Difference]: With dead ends: 47 [2025-03-08 05:50:47,083 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:50:47,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:50:47,084 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:50:47,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:50:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:50:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-08 05:50:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-08 05:50:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-08 05:50:47,094 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 33 [2025-03-08 05:50:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:50:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-08 05:50:47,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:50:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-08 05:50:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:50:47,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:50:47,096 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:50:47,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:50:47,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:50:47,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:50:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:50:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -684455030, now seen corresponding path program 1 times [2025-03-08 05:50:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:50:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722406615] [2025-03-08 05:50:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:50:47,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:50:47,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:50:47,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:47,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:50:47,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115151731] [2025-03-08 05:50:47,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:50:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:50:47,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:50:47,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:50:47,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 05:50:47,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:50:47,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:47,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:50:47,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-08 05:50:47,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:50:47,554 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 15 treesize of output 1 [2025-03-08 05:50:47,556 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 15 treesize of output 1 [2025-03-08 05:50:47,569 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 15 treesize of output 11 [2025-03-08 05:50:47,572 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 15 treesize of output 11 [2025-03-08 05:50:47,578 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 15 treesize of output 11 [2025-03-08 05:50:47,587 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 15 treesize of output 11 [2025-03-08 05:50:47,616 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 11 treesize of output 7 [2025-03-08 05:50:47,620 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 11 treesize of output 7 [2025-03-08 05:50:47,626 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 11 treesize of output 7 [2025-03-08 05:50:47,630 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 11 treesize of output 7 [2025-03-08 05:50:47,862 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 19 treesize of output 11 [2025-03-08 05:50:47,866 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 26 treesize of output 14 [2025-03-08 05:50:47,869 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 10 [2025-03-08 05:50:47,880 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 30 treesize of output 18 [2025-03-08 05:50:47,883 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 15 treesize of output 7 [2025-03-08 05:50:47,887 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 15 treesize of output 7 [2025-03-08 05:50:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:50:47,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:50:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:50:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722406615] [2025-03-08 05:50:47,914 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:50:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115151731] [2025-03-08 05:50:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115151731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:50:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:50:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:50:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880346290] [2025-03-08 05:50:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:50:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:50:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:50:47,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:50:47,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:50:47,915 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:50:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:50:48,050 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-03-08 05:50:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:50:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2025-03-08 05:50:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:50:48,052 INFO L225 Difference]: With dead ends: 53 [2025-03-08 05:50:48,052 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 05:50:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:50:48,052 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:50:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 85 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:50:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 05:50:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 05:50:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-08 05:50:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-08 05:50:48,062 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 43 [2025-03-08 05:50:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:50:48,062 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-08 05:50:48,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:50:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-08 05:50:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:50:48,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:50:48,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:50:48,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:50:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:50:48,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:50:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:50:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -800610683, now seen corresponding path program 1 times [2025-03-08 05:50:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:50:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568906099] [2025-03-08 05:50:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:50:48,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:50:48,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:50:48,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:48,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:50:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040198565] [2025-03-08 05:50:48,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:50:48,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:50:48,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:50:48,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:50:48,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:50:48,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:50:48,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:50:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:50:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:50:48,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 168 conjuncts are in the unsatisfiable core [2025-03-08 05:50:48,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:50:48,772 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 15 treesize of output 1 [2025-03-08 05:50:48,775 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 15 treesize of output 1 [2025-03-08 05:50:48,783 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 15 treesize of output 11 [2025-03-08 05:50:48,787 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 15 treesize of output 11 [2025-03-08 05:50:48,791 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 15 treesize of output 11 [2025-03-08 05:50:48,797 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 15 treesize of output 11 [2025-03-08 05:50:52,959 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1) .cse0) (= .cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1))))) (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_2 Int)) (let ((.cse1 (select (select |c_#memory_int#2| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1) .cse1) (= (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_2) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_2) .cse1))))) is different from true [2025-03-08 05:50:53,152 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 35 treesize of output 21 [2025-03-08 05:50:53,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-08 05:50:53,257 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 42 treesize of output 30 [2025-03-08 05:50:53,265 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 41 treesize of output 29 [2025-03-08 05:50:53,272 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 30 treesize of output 22 [2025-03-08 05:50:53,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2025-03-08 05:50:53,282 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 42 treesize of output 26 [2025-03-08 05:50:53,285 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 26 treesize of output 14 [2025-03-08 05:50:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2025-03-08 05:50:57,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:50:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:50:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:50:59,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568906099] [2025-03-08 05:50:59,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:50:59,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040198565] [2025-03-08 05:50:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040198565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:50:59,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:50:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2025-03-08 05:50:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584169662] [2025-03-08 05:50:59,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:50:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:50:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:50:59,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:50:59,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=289, Unknown=2, NotChecked=34, Total=380 [2025-03-08 05:50:59,900 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:51:16,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:51:20,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:51:32,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:51:36,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:51:42,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:51:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:42,893 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-03-08 05:51:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:51:42,894 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-03-08 05:51:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:42,895 INFO L225 Difference]: With dead ends: 63 [2025-03-08 05:51:42,895 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 05:51:42,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=129, Invalid=626, Unknown=5, NotChecked=52, Total=812 [2025-03-08 05:51:42,896 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:42,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 260 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 309 Invalid, 5 Unknown, 72 Unchecked, 24.9s Time] [2025-03-08 05:51:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 05:51:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-03-08 05:51:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:51:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-08 05:51:42,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 44 [2025-03-08 05:51:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:42,912 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-08 05:51:42,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:51:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-08 05:51:42,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:51:42,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:42,914 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:42,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:51:43,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:43,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:43,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1360712634, now seen corresponding path program 1 times [2025-03-08 05:51:43,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:43,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955641908] [2025-03-08 05:51:43,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:51:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:51:43,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:43,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852912525] [2025-03-08 05:51:43,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:43,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:51:43,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:51:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:51:43,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:51:43,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:43,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 178 conjuncts are in the unsatisfiable core [2025-03-08 05:51:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:43,516 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 15 treesize of output 1 [2025-03-08 05:51:43,518 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 15 treesize of output 1 [2025-03-08 05:51:43,522 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 15 treesize of output 11 [2025-03-08 05:51:43,526 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 15 treesize of output 11 [2025-03-08 05:51:43,531 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 15 treesize of output 11 [2025-03-08 05:51:43,535 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 15 treesize of output 11 [2025-03-08 05:51:43,553 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 11 treesize of output 7 [2025-03-08 05:51:43,555 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 11 treesize of output 7 [2025-03-08 05:51:43,563 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 11 treesize of output 7 [2025-03-08 05:51:43,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:51:52,190 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 33 treesize of output 29 [2025-03-08 05:51:52,197 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 38 treesize of output 27 [2025-03-08 05:51:52,201 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 25 [2025-03-08 05:52:20,607 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_29 Int) (|v_func_to_recursive_line_35_to_46_0_#t~mem5_10| Int) (|v_func_to_recursive_line_35_to_46_0_#t~mem4_10| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_2| Int) (v_arrayElimCell_31 Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_2| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_2| Int)) (= (* (mod (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_2|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_2|) (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_2|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_2|)) 2147483648) 2) (mod (+ (* v_arrayElimCell_29 v_arrayElimCell_31) (* |v_func_to_recursive_line_35_to_46_0_#t~mem5_10| |v_func_to_recursive_line_35_to_46_0_#t~mem4_10|)) 4294967296))) is different from true