./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:36:20,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:36:20,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:36:20,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:36:20,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:36:20,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:36:20,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:36:20,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:36:20,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:36:20,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:36:20,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:36:20,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:36:20,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:36:20,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:36:20,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:36:20,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:36:20,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:36:20,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:36:20,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:36:20,233 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 -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2025-03-08 00:36:20,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:36:20,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:36:20,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:36:20,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:36:20,436 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:36:20,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-03-08 00:36:21,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2caa8e04/550a515101f04668ba49c06019bcc86a/FLAGa9dd1a17c [2025-03-08 00:36:21,762 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:36:21,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-03-08 00:36:21,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2caa8e04/550a515101f04668ba49c06019bcc86a/FLAGa9dd1a17c [2025-03-08 00:36:21,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2caa8e04/550a515101f04668ba49c06019bcc86a [2025-03-08 00:36:21,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:36:21,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:36:21,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:36:21,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:36:21,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:36:21,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ad58ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21, skipping insertion in model container [2025-03-08 00:36:21,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:36:21,886 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-multidimensional/rev-2-n-u.c[321,334] [2025-03-08 00:36:21,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:36:21,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:36:21,917 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-multidimensional/rev-2-n-u.c[321,334] [2025-03-08 00:36:21,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:36:21,936 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:36:21,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21 WrapperNode [2025-03-08 00:36:21,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:36:21,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:36:21,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:36:21,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:36:21,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,961 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-08 00:36:21,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:36:21,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:36:21,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:36:21,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:36:21,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,984 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 00:36:21,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:21,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:36:21,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:36:21,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:36:21,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:36:21,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (1/1) ... [2025-03-08 00:36:22,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:36:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:22,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:36:22,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:36:22,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:36:22,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:36:22,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:36:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:36:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:36:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:36:22,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:36:22,102 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:36:22,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:36:22,207 INFO L1307 $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; [2025-03-08 00:36:22,215 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 00:36:22,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:36:22,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:36:22,222 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:36:22,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:22 BoogieIcfgContainer [2025-03-08 00:36:22,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:36:22,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:36:22,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:36:22,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:36:22,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:36:21" (1/3) ... [2025-03-08 00:36:22,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180ed3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:22, skipping insertion in model container [2025-03-08 00:36:22,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:21" (2/3) ... [2025-03-08 00:36:22,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180ed3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:22, skipping insertion in model container [2025-03-08 00:36:22,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:22" (3/3) ... [2025-03-08 00:36:22,229 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2025-03-08 00:36:22,242 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:36:22,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-2-n-u.c that has 1 procedures, 15 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 00:36:22,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:36:22,293 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;@754cb2f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:36:22,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:36:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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-08 00:36:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:36:22,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:22,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:22,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:22,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -163554950, now seen corresponding path program 1 times [2025-03-08 00:36:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349286893] [2025-03-08 00:36:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:22,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:36:22,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:36:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:22,462 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-08 00:36:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:22,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349286893] [2025-03-08 00:36:22,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349286893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:22,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:22,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:36:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698809332] [2025-03-08 00:36:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:22,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:36:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:22,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:36:22,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:36:22,482 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 00:36:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:22,525 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-03-08 00:36:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:36:22,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-08 00:36:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:22,531 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:36:22,531 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:36:22,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:36:22,538 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:22,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:36:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-08 00:36:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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-08 00:36:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-03-08 00:36:22,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2025-03-08 00:36:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:22,558 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-03-08 00:36:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-08 00:36:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-03-08 00:36:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:36:22,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:22,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:22,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:36:22,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:22,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1336384136, now seen corresponding path program 1 times [2025-03-08 00:36:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932980671] [2025-03-08 00:36:22,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:22,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:36:22,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:36:22,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:22,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:36:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932980671] [2025-03-08 00:36:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932980671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:36:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830372774] [2025-03-08 00:36:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:22,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:36:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:22,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:36:22,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:22,658 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08 00:36:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:22,693 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2025-03-08 00:36:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:36:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-08 00:36:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:22,694 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:36:22,694 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:36:22,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:22,695 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:22,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:36:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-03-08 00:36:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-08 00:36:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-08 00:36:22,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-03-08 00:36:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:22,700 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-08 00:36:22,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08 00:36:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-03-08 00:36:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:36:22,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:22,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:36:22,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -27416659, now seen corresponding path program 1 times [2025-03-08 00:36:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647990006] [2025-03-08 00:36:22,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:22,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:36:22,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:36:22,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:22,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:36:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647990006] [2025-03-08 00:36:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647990006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:36:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644808680] [2025-03-08 00:36:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:22,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:36:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:22,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:36:22,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:22,771 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 00:36:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:22,808 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-03-08 00:36:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:36:22,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-03-08 00:36:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:22,809 INFO L225 Difference]: With dead ends: 35 [2025-03-08 00:36:22,810 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:36:22,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:22,810 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:22,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:36:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2025-03-08 00:36:22,814 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-08 00:36:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-08 00:36:22,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2025-03-08 00:36:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:22,814 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-08 00:36:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 00:36:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-08 00:36:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:36:22,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:22,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:36:22,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1335183014, now seen corresponding path program 1 times [2025-03-08 00:36:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731867590] [2025-03-08 00:36:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:22,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:36:22,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:36:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:36:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731867590] [2025-03-08 00:36:22,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731867590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096520878] [2025-03-08 00:36:22,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:22,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:22,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:36:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:36:22,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:36:22,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:22,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:36:22,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:36:23,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:36:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096520878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:23,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:36:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709083570] [2025-03-08 00:36:23,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:36:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:23,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:36:23,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:36:23,080 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-08 00:36:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:23,160 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-03-08 00:36:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:36:23,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-08 00:36:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:23,160 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:36:23,160 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:36:23,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:36:23,165 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:23,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 33 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:36:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:36:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-03-08 00:36:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-08 00:36:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 00:36:23,170 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 14 [2025-03-08 00:36:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:23,170 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 00:36:23,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-08 00:36:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 00:36:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:36:23,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:23,171 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:23,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:23,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash 922508666, now seen corresponding path program 2 times [2025-03-08 00:36:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447282131] [2025-03-08 00:36:23,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:36:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:23,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:36:23,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:36:23,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:36:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:36:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447282131] [2025-03-08 00:36:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447282131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:23,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464742575] [2025-03-08 00:36:23,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:36:23,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:23,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:23,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:23,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:36:23,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:36:23,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:36:23,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:36:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:23,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:36:23,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:36:23,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:36:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464742575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:23,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 00:36:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80189412] [2025-03-08 00:36:23,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:36:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:23,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:36:23,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:36:23,612 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-08 00:36:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:23,660 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-03-08 00:36:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:36:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 20 [2025-03-08 00:36:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:23,662 INFO L225 Difference]: With dead ends: 73 [2025-03-08 00:36:23,662 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:36:23,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:36:23,664 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:23,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:36:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 00:36:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 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-08 00:36:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-08 00:36:23,672 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 20 [2025-03-08 00:36:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:23,672 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-08 00:36:23,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-08 00:36:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-08 00:36:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:36:23,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:23,672 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:23,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:23,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1018964300, now seen corresponding path program 3 times [2025-03-08 00:36:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882504520] [2025-03-08 00:36:23,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:23,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 13 equivalence classes. [2025-03-08 00:36:23,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 38 statements. [2025-03-08 00:36:23,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:36:23,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:36:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882504520] [2025-03-08 00:36:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882504520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195352570] [2025-03-08 00:36:23,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:23,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:23,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:36:23,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 13 equivalence classes. [2025-03-08 00:36:24,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 38 statements. [2025-03-08 00:36:24,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:36:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:24,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:36:24,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:36:24,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:36:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195352570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:24,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:24,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:36:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625127808] [2025-03-08 00:36:24,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:24,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:36:24,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:24,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:36:24,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:36:24,128 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-08 00:36:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:24,212 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2025-03-08 00:36:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:36:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 38 [2025-03-08 00:36:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:24,214 INFO L225 Difference]: With dead ends: 133 [2025-03-08 00:36:24,214 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 00:36:24,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:36:24,218 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:24,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:36:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 00:36:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2025-03-08 00:36:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 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-08 00:36:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-08 00:36:24,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 38 [2025-03-08 00:36:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:24,229 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-08 00:36:24,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-08 00:36:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-08 00:36:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:36:24,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:24,230 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:24,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:24,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:24,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash -766354566, now seen corresponding path program 4 times [2025-03-08 00:36:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:24,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243840402] [2025-03-08 00:36:24,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:36:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:24,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:36:24,479 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:36:24,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:36:24,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-08 00:36:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243840402] [2025-03-08 00:36:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243840402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064295246] [2025-03-08 00:36:24,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:36:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:24,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:24,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:36:24,671 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:36:24,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 56 statements. [2025-03-08 00:36:24,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:36:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:24,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-08 00:36:24,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:24,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-08 00:36:24,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2025-03-08 00:36:24,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2025-03-08 00:36:24,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2025-03-08 00:36:25,038 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:36:25,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2025-03-08 00:36:25,083 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2025-03-08 00:36:25,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,125 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2025-03-08 00:36:25,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,176 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2025-03-08 00:36:25,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,253 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:36:25,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2025-03-08 00:36:25,303 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2025-03-08 00:36:25,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 27 [2025-03-08 00:36:25,358 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2025-03-08 00:36:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 27 [2025-03-08 00:36:25,408 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2025-03-08 00:36:25,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 27 [2025-03-08 00:36:25,487 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:36:25,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2025-03-08 00:36:25,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,624 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2025-03-08 00:36:25,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2025-03-08 00:36:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 3 proven. 197 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 00:36:25,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:26,941 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 Int) (|v_ULTIMATE.start_main_~j~0#1_121| Int) (v_ArrVal_321 Int) (v_ArrVal_319 Int) (v_ArrVal_317 Int) (v_ArrVal_315 Int) (v_ArrVal_326 Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (= (select (let ((.cse2 (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse1))) (store (store (store (store (let ((.cse0 (* .cse1 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_315) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_121| 4) .cse0) v_ArrVal_317)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2) v_ArrVal_319) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 4) v_ArrVal_321) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 8) v_ArrVal_324) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 12) v_ArrVal_326)) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 4) .cse1 (* .cse1 (+ (- 1) |c_ULTIMATE.start_main_~m~0#1|)))))) (< |v_ULTIMATE.start_main_~j~0#1_121| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2025-03-08 00:37:16,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 Int) (v_ArrVal_311 Int) (|v_ULTIMATE.start_main_~j~0#1_122| Int) (|v_ULTIMATE.start_main_~j~0#1_121| Int) (v_ArrVal_321 Int) (|v_ULTIMATE.start_main_~j~0#1_123| Int) (v_ArrVal_319 Int) (v_ArrVal_317 Int) (v_ArrVal_315 Int) (v_ArrVal_326 Int) (v_ArrVal_314 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_122| (+ |v_ULTIMATE.start_main_~j~0#1_123| 1)) (< |v_ULTIMATE.start_main_~j~0#1_123| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (let ((.cse0 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 4) .cse0 (* .cse0 (+ (- 1) |c_ULTIMATE.start_main_~m~0#1|)))) (select (let ((.cse2 (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse0))) (store (store (store (store (let ((.cse1 (* .cse0 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_311) (+ (* |v_ULTIMATE.start_main_~j~0#1_123| 4) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse1) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_122| 4)) v_ArrVal_315) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_121| 4) .cse1) v_ArrVal_317)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2) v_ArrVal_319) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 4) v_ArrVal_321) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 8) v_ArrVal_324) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 12) v_ArrVal_326)) |c_ULTIMATE.start_main_~#A~0#1.offset|))) (< |v_ULTIMATE.start_main_~j~0#1_121| (+ |v_ULTIMATE.start_main_~j~0#1_122| 1)))) is different from false