./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-3-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:19:57,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:19:57,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:19:57,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:19:57,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:19:57,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:19:57,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:19:57,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:19:57,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:19:57,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:19:57,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:19:57,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:19:57,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:19:57,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:19:57,536 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:19:57,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:19:57,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:19:57,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:19:57,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:19:57,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:19:57,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:19:57,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:19:57,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:19:57,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:19:57,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:19:57,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:19:57,540 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-jdk21/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 -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2025-02-05 10:19:57,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:19:57,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:19:57,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:19:57,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:19:57,785 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:19:57,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-02-05 10:19:58,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fad2adc0/b906d91b44e848eba1ce97b18a2ad189/FLAG79236da9a [2025-02-05 10:19:59,193 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:19:59,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-02-05 10:19:59,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fad2adc0/b906d91b44e848eba1ce97b18a2ad189/FLAG79236da9a [2025-02-05 10:19:59,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fad2adc0/b906d91b44e848eba1ce97b18a2ad189 [2025-02-05 10:19:59,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:19:59,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:19:59,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:19:59,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:19:59,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:19:59,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59, skipping insertion in model container [2025-02-05 10:19:59,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:19:59,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c[319,332] [2025-02-05 10:19:59,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:19:59,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:19:59,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c[319,332] [2025-02-05 10:19:59,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:19:59,450 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:19:59,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59 WrapperNode [2025-02-05 10:19:59,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:19:59,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:19:59,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:19:59,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:19:59,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,473 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-02-05 10:19:59,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:19:59,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:19:59,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:19:59,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:19:59,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,489 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 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-02-05 10:19:59,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:19:59,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:19:59,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:19:59,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:19:59,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (1/1) ... [2025-02-05 10:19:59,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:19:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:59,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:19:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:19:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:19:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:19:59,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:19:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:19:59,604 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:19:59,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:19:59,739 INFO L1309 $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-02-05 10:19:59,747 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 10:19:59,747 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:19:59,753 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:19:59,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:19:59,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:19:59 BoogieIcfgContainer [2025-02-05 10:19:59,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:19:59,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:19:59,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:19:59,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:19:59,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:19:59" (1/3) ... [2025-02-05 10:19:59,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7035cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:19:59, skipping insertion in model container [2025-02-05 10:19:59,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:59" (2/3) ... [2025-02-05 10:19:59,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7035cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:19:59, skipping insertion in model container [2025-02-05 10:19:59,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:19:59" (3/3) ... [2025-02-05 10:19:59,760 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2025-02-05 10:19:59,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:19:59,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-3-u.c that has 1 procedures, 18 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-02-05 10:19:59,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:19:59,826 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;@2b955215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:19:59,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:19:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-02-05 10:19:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:19:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:59,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:59,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:59,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1848885614, now seen corresponding path program 1 times [2025-02-05 10:19:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:59,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244475433] [2025-02-05 10:19:59,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:19:59,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:59,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:19:59,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:19:59,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:19:59,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244475433] [2025-02-05 10:20:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244475433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:00,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:00,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:20:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476137022] [2025-02-05 10:20:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:00,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:20:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:00,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:20:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:20:00,039 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-05 10:20:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:00,089 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2025-02-05 10:20:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:20:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-02-05 10:20:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:00,094 INFO L225 Difference]: With dead ends: 34 [2025-02-05 10:20:00,095 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 10:20:00,096 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-02-05 10:20:00,101 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:00,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 10:20:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-05 10:20:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 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-02-05 10:20:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-02-05 10:20:00,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2025-02-05 10:20:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:00,121 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-02-05 10:20:00,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-02-05 10:20:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2025-02-05 10:20:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:20:00,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:00,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:20:00,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2113392682, now seen corresponding path program 1 times [2025-02-05 10:20:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508947951] [2025-02-05 10:20:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:20:00,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:20:00,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:00,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:00,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508947951] [2025-02-05 10:20:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508947951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:00,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:20:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669175164] [2025-02-05 10:20:00,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:00,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:20:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:00,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:20:00,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:20:00,219 INFO L87 Difference]: Start difference. First operand 16 states and 24 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-02-05 10:20:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:00,264 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2025-02-05 10:20:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:20:00,264 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-02-05 10:20:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:00,265 INFO L225 Difference]: With dead ends: 39 [2025-02-05 10:20:00,265 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 10:20:00,265 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-02-05 10:20:00,266 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:00,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 10:20:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-02-05 10:20:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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-02-05 10:20:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2025-02-05 10:20:00,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 11 [2025-02-05 10:20:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2025-02-05 10:20:00,270 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-02-05 10:20:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2025-02-05 10:20:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 10:20:00,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:00,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:20:00,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1931208308, now seen corresponding path program 1 times [2025-02-05 10:20:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852166761] [2025-02-05 10:20:00,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:00,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:20:00,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:20:00,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:20:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852166761] [2025-02-05 10:20:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852166761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:00,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:20:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967654695] [2025-02-05 10:20:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:20:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:00,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:20:00,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:20:00,352 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-05 10:20:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:00,390 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2025-02-05 10:20:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:20:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-02-05 10:20:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:00,394 INFO L225 Difference]: With dead ends: 42 [2025-02-05 10:20:00,394 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 10:20:00,395 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-02-05 10:20:00,395 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:00,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 10:20:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-02-05 10:20:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-02-05 10:20:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-02-05 10:20:00,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2025-02-05 10:20:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:00,403 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-05 10:20:00,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-05 10:20:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-02-05 10:20:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:20:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:00,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:20:00,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 536396986, now seen corresponding path program 1 times [2025-02-05 10:20:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-02-05 10:20:00,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:20:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:20:00,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:00,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:20:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908786364] [2025-02-05 10:20:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908786364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:20:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938547285] [2025-02-05 10:20:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:00,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:20:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:00,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:20:00,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:20:00,517 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02-05 10:20:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:00,560 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-02-05 10:20:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:20:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02-05 10:20:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:00,561 INFO L225 Difference]: With dead ends: 49 [2025-02-05 10:20:00,561 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 10:20:00,561 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-02-05 10:20:00,562 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:00,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 10:20:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2025-02-05 10:20:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-02-05 10:20:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-05 10:20:00,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-02-05 10:20:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:00,566 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-05 10:20:00,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02-05 10:20:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-05 10:20:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:20:00,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:00,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:00,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:20:00,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:00,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1319651918, now seen corresponding path program 1 times [2025-02-05 10:20:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:00,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527055227] [2025-02-05 10:20:00,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:00,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:20:00,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:20:00,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:00,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:20:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527055227] [2025-02-05 10:20:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527055227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165268924] [2025-02-05 10:20:00,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:00,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:00,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:20:00,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:20:00,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:20:00,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:20:00,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:00,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:00,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:20:00,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:20:00,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:20:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165268924] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:00,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:00,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:20:00,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843095521] [2025-02-05 10:20:00,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:00,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:20:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:00,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:20:00,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:20:00,820 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-02-05 10:20:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:00,920 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-02-05 10:20:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:20:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 19 [2025-02-05 10:20:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:00,921 INFO L225 Difference]: With dead ends: 64 [2025-02-05 10:20:00,921 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:20:00,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 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-02-05 10:20:00,922 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:00,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 18 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:20:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:20:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-02-05 10:20:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 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-02-05 10:20:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-02-05 10:20:00,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2025-02-05 10:20:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:00,929 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-02-05 10:20:00,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-02-05 10:20:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-02-05 10:20:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:20:00,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:00,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:00,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:20:01,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:01,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:01,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1750155182, now seen corresponding path program 2 times [2025-02-05 10:20:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986563957] [2025-02-05 10:20:01,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:20:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:01,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:20:01,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:01,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:20:01,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 10:20:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986563957] [2025-02-05 10:20:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986563957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551181854] [2025-02-05 10:20:01,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:20:01,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:01,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:01,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:20:01,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:20:01,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:20:01,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:20:01,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:20:01,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:01,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:20:01,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:20:01,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:20:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551181854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:01,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:01,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-02-05 10:20:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912497856] [2025-02-05 10:20:01,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:01,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:20:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:01,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:20:01,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:20:01,415 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-02-05 10:20:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:01,961 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2025-02-05 10:20:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 10:20:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 25 [2025-02-05 10:20:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:01,963 INFO L225 Difference]: With dead ends: 283 [2025-02-05 10:20:01,963 INFO L226 Difference]: Without dead ends: 248 [2025-02-05 10:20:01,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 10:20:01,964 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 700 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:01,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 42 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:20:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-05 10:20:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 96. [2025-02-05 10:20:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 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-02-05 10:20:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-02-05 10:20:01,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 25 [2025-02-05 10:20:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:01,988 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-02-05 10:20:01,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-02-05 10:20:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-02-05 10:20:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 10:20:01,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:01,990 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:01,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:20:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:02,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:02,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -677073902, now seen corresponding path program 3 times [2025-02-05 10:20:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-02-05 10:20:02,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:20:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:02,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-02-05 10:20:02,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 61 of 65 statements. [2025-02-05 10:20:02,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-02-05 10:20:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-02-05 10:20:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249788740] [2025-02-05 10:20:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249788740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252283608] [2025-02-05 10:20:02,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:20:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:02,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:20:02,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:20:02,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-02-05 10:20:13,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 57 of 65 statements. [2025-02-05 10:20:13,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-05 10:20:13,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:13,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-02-05 10:20:13,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:13,697 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 33 treesize of output 1 [2025-02-05 10:20:13,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 10:20:13,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:13,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-05 10:20:14,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:14,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-05 10:20:14,421 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-05 10:20:14,422 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 45 treesize of output 26 [2025-02-05 10:20:14,497 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,497 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 58 treesize of output 37 [2025-02-05 10:20:14,560 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,560 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 58 treesize of output 37 [2025-02-05 10:20:14,623 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,623 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 58 treesize of output 37 [2025-02-05 10:20:14,688 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,689 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 58 treesize of output 37 [2025-02-05 10:20:14,753 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,753 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 58 treesize of output 37 [2025-02-05 10:20:14,824 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,825 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 58 treesize of output 37 [2025-02-05 10:20:14,893 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,893 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 58 treesize of output 37 [2025-02-05 10:20:14,962 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2025-02-05 10:20:14,962 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 58 treesize of output 37 [2025-02-05 10:20:15,033 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-02-05 10:20:15,033 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 56 treesize of output 37 [2025-02-05 10:20:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 10:20:15,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:10,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_153| Int) (|v_ULTIMATE.start_main_~k~0#1_151| Int) (|v_ULTIMATE.start_main_~j~0#1_74| Int) (v_ArrVal_269 Int) (v_ArrVal_279 Int) (v_ArrVal_266 Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (v_ArrVal_276 Int) (v_ArrVal_264 Int) (v_ArrVal_274 Int) (v_ArrVal_262 Int) (v_ArrVal_272 Int) (v_ArrVal_271 Int) (v_ArrVal_282 Int) (v_ArrVal_281 Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~n~0#1| .cse1))) (= (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_37| .cse0)) (.cse3 (* |v_ULTIMATE.start_main_~j~0#1_74| .cse1)) (.cse4 (* 4 |v_ULTIMATE.start_main_~k~0#1_151|))) (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|) (* .cse0 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~j~0#1| .cse1)) v_ArrVal_262) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 (* 4 |v_ULTIMATE.start_main_~k~0#1_153|)) v_ArrVal_264) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4) v_ArrVal_266) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 4) v_ArrVal_269) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 8) v_ArrVal_271) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 12) v_ArrVal_272) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 16) v_ArrVal_274) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 20) v_ArrVal_276) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 24) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 28) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 .cse3 .cse4 32) v_ArrVal_282)) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) (let ((.cse5 (+ |c_ULTIMATE.start_main_~n~0#1| (- 1)))) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* .cse5 .cse0) (* .cse5 .cse1) (- 4) .cse1)))))) (< (+ 9 |v_ULTIMATE.start_main_~k~0#1_151|) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~k~0#1_153| 1) |v_ULTIMATE.start_main_~k~0#1_151|) (< (+ |v_ULTIMATE.start_main_~j~0#1_74| 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |c_ULTIMATE.start_main_~n~0#1|))) is different from false [2025-02-05 10:21:14,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_153| Int) (|v_ULTIMATE.start_main_~k~0#1_154| Int) (|v_ULTIMATE.start_main_~k~0#1_151| Int) (|v_ULTIMATE.start_main_~j~0#1_74| Int) (v_ArrVal_269 Int) (v_ArrVal_279 Int) (v_ArrVal_266 Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (v_ArrVal_276 Int) (v_ArrVal_264 Int) (v_ArrVal_274 Int) (v_ArrVal_262 Int) (v_ArrVal_272 Int) (v_ArrVal_260 Int) (v_ArrVal_271 Int) (v_ArrVal_282 Int) (v_ArrVal_281 Int)) (or (< (+ 9 |v_ULTIMATE.start_main_~k~0#1_151|) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~k~0#1_153| 1) |v_ULTIMATE.start_main_~k~0#1_151|) (< (+ |v_ULTIMATE.start_main_~j~0#1_74| 1) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse2 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| .cse2))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 1)))) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* .cse0 .cse1) (* .cse0 .cse2) (- 4) .cse2))) (select (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_37| .cse1)) (.cse6 (* |v_ULTIMATE.start_main_~j~0#1_74| .cse2)) (.cse7 (* 4 |v_ULTIMATE.start_main_~k~0#1_151|))) (store (store (store (store (store (store (store (store (store (store (let ((.cse3 (* .cse1 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~j~0#1| .cse2))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|) .cse3 .cse4) v_ArrVal_260) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_154|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4) v_ArrVal_262)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 (* 4 |v_ULTIMATE.start_main_~k~0#1_153|)) v_ArrVal_264) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7) v_ArrVal_266) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 4) v_ArrVal_269) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 8) v_ArrVal_271) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 12) v_ArrVal_272) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 16) v_ArrVal_274) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 20) v_ArrVal_276) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 24) v_ArrVal_279) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 28) v_ArrVal_281) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 .cse7 32) v_ArrVal_282)) |c_ULTIMATE.start_main_~#A~0#1.offset|)))) (< |v_ULTIMATE.start_main_~k~0#1_154| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |c_ULTIMATE.start_main_~n~0#1|))) is different from false