./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array-industry-pattern/array_single_elem_init.i -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 783ac259376d0d4b331b84c9ee3bd0ed2042af56d21e98db70a8bebb07aee3c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:30:37,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:30:37,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:30:37,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:30:37,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:30:37,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:30:37,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:30:37,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:30:37,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:30:37,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:30:37,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:30:37,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:30:37,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:30:37,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:30:37,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:30:37,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:30:37,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:30:37,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:30:37,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:30:37,282 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 -> 783ac259376d0d4b331b84c9ee3bd0ed2042af56d21e98db70a8bebb07aee3c2 [2025-03-16 13:30:37,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:30:37,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:30:37,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:30:37,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:30:37,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:30:37,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2025-03-16 13:30:38,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec03a5a8/5fb39ad2d955478abc8bec9fa2a83e45/FLAG157774f63 [2025-03-16 13:30:38,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:30:38,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_single_elem_init.i [2025-03-16 13:30:38,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec03a5a8/5fb39ad2d955478abc8bec9fa2a83e45/FLAG157774f63 [2025-03-16 13:30:38,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec03a5a8/5fb39ad2d955478abc8bec9fa2a83e45 [2025-03-16 13:30:38,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:30:38,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:30:38,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:30:38,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:30:38,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:30:38,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:30:38" (1/1) ... [2025-03-16 13:30:38,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ab0e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:38, skipping insertion in model container [2025-03-16 13:30:38,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:30:38" (1/1) ... [2025-03-16 13:30:38,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:30:39,011 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/array-industry-pattern/array_single_elem_init.i[815,828] [2025-03-16 13:30:39,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:30:39,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:30:39,034 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/array-industry-pattern/array_single_elem_init.i[815,828] [2025-03-16 13:30:39,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:30:39,047 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:30:39,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39 WrapperNode [2025-03-16 13:30:39,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:30:39,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:30:39,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:30:39,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:30:39,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,070 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-16 13:30:39,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:30:39,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:30:39,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:30:39,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:30:39,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,093 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 2, 3, 4]. 36 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 1, 2, 3]. [2025-03-16 13:30:39,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:30:39,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:30:39,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:30:39,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:30:39,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (1/1) ... [2025-03-16 13:30:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:30:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:39,126 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-16 13:30:39,129 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-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:30:39,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 13:30:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:30:39,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:30:39,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:30:39,302 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: 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_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-16 13:30:39,309 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 13:30:39,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:30:39,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:30:39,315 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:30:39,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:30:39 BoogieIcfgContainer [2025-03-16 13:30:39,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:30:39,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:30:39,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:30:39,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:30:39,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:30:38" (1/3) ... [2025-03-16 13:30:39,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f2f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:30:39, skipping insertion in model container [2025-03-16 13:30:39,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:30:39" (2/3) ... [2025-03-16 13:30:39,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f2f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:30:39, skipping insertion in model container [2025-03-16 13:30:39,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:30:39" (3/3) ... [2025-03-16 13:30:39,321 INFO L128 eAbstractionObserver]: Analyzing ICFG array_single_elem_init.i [2025-03-16 13:30:39,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:30:39,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_single_elem_init.i that has 1 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 13:30:39,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:30:39,376 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;@33b97970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:30:39,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:30:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 13:30:39,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:39,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 13:30:39,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:39,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1558347284, now seen corresponding path program 1 times [2025-03-16 13:30:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260611766] [2025-03-16 13:30:39,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:30:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:39,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 13:30:39,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 13:30:39,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:30:39,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:39,555 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-16 13:30:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260611766] [2025-03-16 13:30:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260611766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:30:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:30:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:30:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393459041] [2025-03-16 13:30:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:30:39,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:30:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:39,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:30:39,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:30:39,578 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:39,636 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2025-03-16 13:30:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:30:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-16 13:30:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:39,642 INFO L225 Difference]: With dead ends: 36 [2025-03-16 13:30:39,643 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 13:30:39,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:30:39,648 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:39,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:30:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 13:30:39,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2025-03-16 13:30:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-16 13:30:39,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 6 [2025-03-16 13:30:39,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-16 13:30:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-16 13:30:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 13:30:39,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:39,670 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:30:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:30:39,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -401956144, now seen corresponding path program 1 times [2025-03-16 13:30:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144547903] [2025-03-16 13:30:39,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:30:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:39,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 13:30:39,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 13:30:39,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:30:39,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:30:39,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144547903] [2025-03-16 13:30:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144547903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152216449] [2025-03-16 13:30:39,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:30:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:39,779 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-16 13:30:39,782 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-16 13:30:39,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 13:30:39,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 13:30:39,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:30:39,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:39,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:30:39,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:30:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:30:39,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:30:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 13:30:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152216449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:30:39,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:30:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-16 13:30:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249279004] [2025-03-16 13:30:39,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:30:39,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:30:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:39,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:30:39,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:30:39,935 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:40,024 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-03-16 13:30:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:30:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 13:30:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:40,025 INFO L225 Difference]: With dead ends: 52 [2025-03-16 13:30:40,025 INFO L226 Difference]: Without dead ends: 43 [2025-03-16 13:30:40,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:30:40,026 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:40,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:30:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-16 13:30:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2025-03-16 13:30:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2025-03-16 13:30:40,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 14 [2025-03-16 13:30:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:40,031 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2025-03-16 13:30:40,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2025-03-16 13:30:40,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 13:30:40,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:40,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 13:30:40,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:30:40,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:40,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:40,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 293018740, now seen corresponding path program 2 times [2025-03-16 13:30:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205828609] [2025-03-16 13:30:40,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:30:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:40,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-16 13:30:40,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 13:30:40,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:30:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 13:30:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205828609] [2025-03-16 13:30:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205828609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:30:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:30:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:30:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516869171] [2025-03-16 13:30:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:30:40,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:30:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:30:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:30:40,447 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:40,485 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2025-03-16 13:30:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:30:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 13:30:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:40,486 INFO L225 Difference]: With dead ends: 86 [2025-03-16 13:30:40,486 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 13:30:40,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:30:40,486 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:40,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:30:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 13:30:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-03-16 13:30:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-03-16 13:30:40,491 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 32 [2025-03-16 13:30:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:40,491 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-03-16 13:30:40,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-03-16 13:30:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 13:30:40,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:40,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 13:30:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:30:40,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:40,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -674146892, now seen corresponding path program 1 times [2025-03-16 13:30:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184134069] [2025-03-16 13:30:40,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:30:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 13:30:40,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 13:30:40,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:30:40,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:30:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184134069] [2025-03-16 13:30:40,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184134069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:40,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656771334] [2025-03-16 13:30:40,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:30:40,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:40,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:40,589 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-16 13:30:40,591 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-16 13:30:40,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 13:30:40,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 13:30:40,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:30:40,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:40,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:30:40,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:30:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:30:40,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:30:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:30:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656771334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:30:40,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:30:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-16 13:30:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134976469] [2025-03-16 13:30:40,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:30:40,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:30:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:40,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:30:40,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:30:40,756 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:40,898 INFO L93 Difference]: Finished difference Result 129 states and 175 transitions. [2025-03-16 13:30:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:30:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 13:30:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:40,900 INFO L225 Difference]: With dead ends: 129 [2025-03-16 13:30:40,900 INFO L226 Difference]: Without dead ends: 117 [2025-03-16 13:30:40,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:30:40,901 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 172 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:40,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 32 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:30:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-16 13:30:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2025-03-16 13:30:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 102 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2025-03-16 13:30:40,907 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 32 [2025-03-16 13:30:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:40,907 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2025-03-16 13:30:40,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2025-03-16 13:30:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 13:30:40,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:40,909 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 5, 5, 1, 1, 1, 1, 1] [2025-03-16 13:30:40,915 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-16 13:30:41,113 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,SelfDestructingSolverStorable3 [2025-03-16 13:30:41,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:41,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash 803126187, now seen corresponding path program 2 times [2025-03-16 13:30:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:41,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246071658] [2025-03-16 13:30:41,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:30:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:41,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-16 13:30:41,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 13:30:41,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:30:41,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 13:30:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246071658] [2025-03-16 13:30:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246071658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068472689] [2025-03-16 13:30:41,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:30:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:41,349 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-16 13:30:41,350 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-16 13:30:41,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-16 13:30:41,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 13:30:41,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:30:41,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:41,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:30:41,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:30:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 13:30:41,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:30:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 13:30:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068472689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:30:41,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:30:41,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-16 13:30:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092199317] [2025-03-16 13:30:41,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:30:41,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:30:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:41,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:30:41,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:30:41,758 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 25 states, 25 states have (on average 4.64) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:42,043 INFO L93 Difference]: Finished difference Result 270 states and 367 transitions. [2025-03-16 13:30:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:30:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.64) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 13:30:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:42,046 INFO L225 Difference]: With dead ends: 270 [2025-03-16 13:30:42,046 INFO L226 Difference]: Without dead ends: 249 [2025-03-16 13:30:42,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:30:42,047 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:42,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 62 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:30:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-16 13:30:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 217. [2025-03-16 13:30:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3194444444444444) internal successors, (285), 216 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 285 transitions. [2025-03-16 13:30:42,057 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 285 transitions. Word has length 71 [2025-03-16 13:30:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 285 transitions. [2025-03-16 13:30:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.64) internal successors, (116), 24 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 285 transitions. [2025-03-16 13:30:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 13:30:42,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:42,060 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 12, 11, 11, 1, 1, 1, 1, 1] [2025-03-16 13:30:42,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 13:30:42,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:42,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:42,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 605855947, now seen corresponding path program 3 times [2025-03-16 13:30:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850273301] [2025-03-16 13:30:42,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:30:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:42,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 23 equivalence classes. [2025-03-16 13:30:42,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 94 of 149 statements. [2025-03-16 13:30:42,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 13:30:42,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-03-16 13:30:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:42,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850273301] [2025-03-16 13:30:42,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850273301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:42,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648283383] [2025-03-16 13:30:42,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:30:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:42,536 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-16 13:30:42,538 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-16 13:30:42,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 23 equivalence classes. [2025-03-16 13:30:42,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 94 of 149 statements. [2025-03-16 13:30:42,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 13:30:42,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:42,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 13:30:42,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:30:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-03-16 13:30:42,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:30:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2025-03-16 13:30:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648283383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:30:42,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:30:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-16 13:30:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920004071] [2025-03-16 13:30:42,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:30:42,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 13:30:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:42,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 13:30:42,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2025-03-16 13:30:42,956 INFO L87 Difference]: Start difference. First operand 217 states and 285 transitions. Second operand has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:43,223 INFO L93 Difference]: Finished difference Result 319 states and 412 transitions. [2025-03-16 13:30:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 13:30:43,225 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-16 13:30:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:43,226 INFO L225 Difference]: With dead ends: 319 [2025-03-16 13:30:43,227 INFO L226 Difference]: Without dead ends: 280 [2025-03-16 13:30:43,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2025-03-16 13:30:43,228 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 522 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:43,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 73 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:30:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-16 13:30:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 272. [2025-03-16 13:30:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 271 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 346 transitions. [2025-03-16 13:30:43,244 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 346 transitions. Word has length 149 [2025-03-16 13:30:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 346 transitions. [2025-03-16 13:30:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 346 transitions. [2025-03-16 13:30:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 13:30:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:43,247 INFO L218 NwaCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2025-03-16 13:30:43,253 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-16 13:30:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:43,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1820170348, now seen corresponding path program 4 times [2025-03-16 13:30:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135613250] [2025-03-16 13:30:43,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:30:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:43,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 198 statements into 2 equivalence classes. [2025-03-16 13:30:43,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 13:30:43,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:30:43,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-16 13:30:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:44,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135613250] [2025-03-16 13:30:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135613250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:44,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136422732] [2025-03-16 13:30:44,125 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:30:44,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:44,129 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-16 13:30:44,131 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-16 13:30:44,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 198 statements into 2 equivalence classes. [2025-03-16 13:30:44,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 13:30:44,231 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:30:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:44,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 13:30:44,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:30:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-16 13:30:44,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:30:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-03-16 13:30:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136422732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:30:45,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:30:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-16 13:30:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305872183] [2025-03-16 13:30:45,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:30:45,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 13:30:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:30:45,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 13:30:45,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 13:30:45,064 INFO L87 Difference]: Start difference. First operand 272 states and 346 transitions. Second operand has 52 states, 52 states have (on average 4.8076923076923075) internal successors, (250), 51 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:30:45,793 INFO L93 Difference]: Finished difference Result 635 states and 839 transitions. [2025-03-16 13:30:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-16 13:30:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.8076923076923075) internal successors, (250), 51 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-16 13:30:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:30:45,797 INFO L225 Difference]: With dead ends: 635 [2025-03-16 13:30:45,797 INFO L226 Difference]: Without dead ends: 557 [2025-03-16 13:30:45,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 13:30:45,799 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1063 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 13:30:45,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 126 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 13:30:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-16 13:30:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 483. [2025-03-16 13:30:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.3174273858921162) internal successors, (635), 482 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 635 transitions. [2025-03-16 13:30:45,822 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 635 transitions. Word has length 198 [2025-03-16 13:30:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:30:45,822 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 635 transitions. [2025-03-16 13:30:45,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.8076923076923075) internal successors, (250), 51 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:30:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 635 transitions. [2025-03-16 13:30:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-16 13:30:45,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:30:45,828 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 50, 50, 26, 25, 25, 1, 1, 1, 1, 1] [2025-03-16 13:30:45,834 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-16 13:30:46,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:46,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:30:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:30:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -537419925, now seen corresponding path program 5 times [2025-03-16 13:30:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:30:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838619315] [2025-03-16 13:30:46,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:30:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:30:46,053 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 51 equivalence classes. [2025-03-16 13:30:46,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 13:30:46,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2025-03-16 13:30:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:30:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7125 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-03-16 13:30:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:30:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838619315] [2025-03-16 13:30:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838619315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:30:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055786182] [2025-03-16 13:30:48,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:30:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:30:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:30:48,136 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-16 13:30:48,137 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-16 13:30:48,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 51 equivalence classes. [2025-03-16 13:32:02,981 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 13:32:02,981 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2025-03-16 13:32:02,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:03,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 13:32:03,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:32:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7125 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2025-03-16 13:32:03,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:32:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7125 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 6175 trivial. 0 not checked. [2025-03-16 13:32:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055786182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:32:04,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:32:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 28, 28] total 79 [2025-03-16 13:32:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993829624] [2025-03-16 13:32:04,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:32:04,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-03-16 13:32:04,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:32:04,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-03-16 13:32:04,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2025-03-16 13:32:04,020 INFO L87 Difference]: Start difference. First operand 483 states and 635 transitions. Second operand has 79 states, 79 states have (on average 5.3164556962025316) internal successors, (420), 79 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:32:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:32:05,356 INFO L93 Difference]: Finished difference Result 944 states and 1260 transitions. [2025-03-16 13:32:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-16 13:32:05,357 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 5.3164556962025316) internal successors, (420), 79 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2025-03-16 13:32:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:32:05,360 INFO L225 Difference]: With dead ends: 944 [2025-03-16 13:32:05,360 INFO L226 Difference]: Without dead ends: 863 [2025-03-16 13:32:05,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2025-03-16 13:32:05,361 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1716 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 13:32:05,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 175 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 13:32:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-16 13:32:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 855. [2025-03-16 13:32:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.2740046838407495) internal successors, (1088), 854 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:32:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1088 transitions. [2025-03-16 13:32:05,374 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1088 transitions. Word has length 331 [2025-03-16 13:32:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:32:05,375 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1088 transitions. [2025-03-16 13:32:05,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 5.3164556962025316) internal successors, (420), 79 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:32:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1088 transitions. [2025-03-16 13:32:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-16 13:32:05,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:32:05,381 INFO L218 NwaCegarLoop]: trace histogram [78, 77, 77, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1] [2025-03-16 13:32:05,425 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-16 13:32:05,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:05,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:32:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:32:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2035414895, now seen corresponding path program 6 times [2025-03-16 13:32:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:32:05,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444476250] [2025-03-16 13:32:05,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:32:05,615 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 622 statements into 78 equivalence classes. [2025-03-16 13:32:05,949 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 78 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 13:32:05,950 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 78 check-sat command(s) [2025-03-16 13:32:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:32:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23639 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 8932 trivial. 0 not checked. [2025-03-16 13:32:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:32:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444476250] [2025-03-16 13:32:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444476250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:32:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578696011] [2025-03-16 13:32:09,816 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:32:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:32:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:32:09,817 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-16 13:32:09,818 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-16 13:32:09,928 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 622 statements into 78 equivalence classes.