./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/transpose-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/transpose-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 44b06771d393671cf9550617b8bf478abc837489f84f20705c70efc1808f7508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:20:14,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:20:14,301 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:20:14,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:20:14,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:20:14,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:20:14,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:20:14,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:20:14,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:20:14,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:20:14,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:20:14,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:20:14,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:20:14,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:20:14,338 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:20:14,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:20:14,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:20:14,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:20:14,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:20:14,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:20:14,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:20:14,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:20:14,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:20:14,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:20:14,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:20:14,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:20:14,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:20:14,341 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 -> 44b06771d393671cf9550617b8bf478abc837489f84f20705c70efc1808f7508 [2025-02-05 10:20:14,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:20:14,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:20:14,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:20:14,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:20:14,625 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:20:14,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/transpose-u.c [2025-02-05 10:20:15,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef52e2870/40d8165902b848c3bb166073de6262d3/FLAGeb880f029 [2025-02-05 10:20:16,164 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:20:16,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/transpose-u.c [2025-02-05 10:20:16,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef52e2870/40d8165902b848c3bb166073de6262d3/FLAGeb880f029 [2025-02-05 10:20:16,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef52e2870/40d8165902b848c3bb166073de6262d3 [2025-02-05 10:20:16,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:20:16,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:20:16,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:20:16,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:20:16,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:20:16,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a58a83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16, skipping insertion in model container [2025-02-05 10:20:16,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:20:16,387 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/transpose-u.c[315,328] [2025-02-05 10:20:16,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:20:16,418 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:20:16,426 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/transpose-u.c[315,328] [2025-02-05 10:20:16,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:20:16,449 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:20:16,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16 WrapperNode [2025-02-05 10:20:16,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:20:16,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:20:16,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:20:16,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:20:16,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:20:16" (1/1) ... [2025-02-05 10:20:16,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:20:16" (1/1) ... [2025-02-05 10:20:16,476 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-02-05 10:20:16,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:20:16,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:20:16,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:20:16,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:20:16,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,505 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:20:16,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:20:16,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:20:16,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:20:16,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:20:16,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (1/1) ... [2025-02-05 10:20:16,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:20:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:16,553 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:20:16,560 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:20:16,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:20:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:20:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:20:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:20:16,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:20:16,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:20:16,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:20:16,652 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:20:16,655 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:20:16,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: 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_~#C~0#1.base, main_~#C~0#1.offset);havoc main_~#C~0#1.base, main_~#C~0#1.offset; [2025-02-05 10:20:16,813 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 10:20:16,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:20:16,823 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:20:16,823 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:20:16,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:20:16 BoogieIcfgContainer [2025-02-05 10:20:16,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:20:16,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:20:16,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:20:16,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:20:16,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:20:16" (1/3) ... [2025-02-05 10:20:16,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f8504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:20:16, skipping insertion in model container [2025-02-05 10:20:16,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:20:16" (2/3) ... [2025-02-05 10:20:16,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439f8504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:20:16, skipping insertion in model container [2025-02-05 10:20:16,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:20:16" (3/3) ... [2025-02-05 10:20:16,832 INFO L128 eAbstractionObserver]: Analyzing ICFG transpose-u.c [2025-02-05 10:20:16,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:20:16,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transpose-u.c that has 1 procedures, 15 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-05 10:20:16,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:20:16,900 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;@6cf044dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:20:16,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:20:16,904 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-02-05 10:20:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 10:20:16,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:16,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:16,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:16,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1471514874, now seen corresponding path program 1 times [2025-02-05 10:20:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433918212] [2025-02-05 10:20:16,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:16,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 10:20:17,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 10:20:17,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:17,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:17,178 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:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433918212] [2025-02-05 10:20:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433918212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:17,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:17,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:20:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416259237] [2025-02-05 10:20:17,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:17,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:20:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:17,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:20:17,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:20:17,202 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-02-05 10:20:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:17,257 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-02-05 10:20:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:20:17,261 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-02-05 10:20:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:17,266 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:20:17,268 INFO L226 Difference]: Without dead ends: 14 [2025-02-05 10:20:17,271 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:17,275 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-02-05 10:20:17,276 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-02-05 10:20:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-05 10:20:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-05 10:20:17,300 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-02-05 10:20:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-05 10:20:17,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2025-02-05 10:20:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:17,306 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-05 10:20:17,306 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-02-05 10:20:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-02-05 10:20:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:20:17,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:17,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:17,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:20:17,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1992313640, now seen corresponding path program 1 times [2025-02-05 10:20:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157716344] [2025-02-05 10:20:17,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:17,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:20:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:20:17,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:17,451 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:17,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:17,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157716344] [2025-02-05 10:20:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157716344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:17,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:20:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392709034] [2025-02-05 10:20:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:17,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:20:17,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:17,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:20:17,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:20:17,453 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-02-05 10:20:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:17,514 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2025-02-05 10:20:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:20:17,516 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-02-05 10:20:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:17,516 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:20:17,516 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:20:17,517 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:17,519 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:17,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:20:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:20:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-02-05 10:20:17,523 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-02-05 10:20:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-02-05 10:20:17,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-02-05 10:20:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-05 10:20:17,524 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-02-05 10:20:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-02-05 10:20:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:20:17,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:17,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:20:17,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1113605196, now seen corresponding path program 1 times [2025-02-05 10:20:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972495714] [2025-02-05 10:20:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:17,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:20:17,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:20:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:17,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:17,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972495714] [2025-02-05 10:20:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972495714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:20:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:20:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:20:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695216239] [2025-02-05 10:20:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:20:17,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:20:17,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:17,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:20:17,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:20:17,601 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-02-05 10:20:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:17,665 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-02-05 10:20:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:20:17,665 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:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:17,666 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:20:17,667 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:20:17,667 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:17,668 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:17,669 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.1s Time] [2025-02-05 10:20:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:20:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2025-02-05 10:20:17,676 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-02-05 10:20:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-02-05 10:20:17,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2025-02-05 10:20:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:17,679 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-05 10:20:17,679 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:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-02-05 10:20:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:20:17,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:17,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:17,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:20:17,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 475717754, now seen corresponding path program 1 times [2025-02-05 10:20:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560666834] [2025-02-05 10:20:17,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:17,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:20:17,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:20:17,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:17,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560666834] [2025-02-05 10:20:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560666834] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610714563] [2025-02-05 10:20:17,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:20:17,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:17,853 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:17,855 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:17,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:20:17,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:20:17,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:20:17,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:17,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:20:17,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:18,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:20:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610714563] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:18,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:20:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538629827] [2025-02-05 10:20:18,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:18,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:20:18,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:18,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:20:18,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:20:18,052 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-02-05 10:20:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:18,171 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-02-05 10:20:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:20:18,172 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-02-05 10:20:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:18,172 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:20:18,172 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:20:18,173 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-02-05 10:20:18,173 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:18,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:20:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:20:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-02-05 10:20:18,182 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-02-05 10:20:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-02-05 10:20:18,184 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 14 [2025-02-05 10:20:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:18,184 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-02-05 10:20:18,184 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-02-05 10:20:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-02-05 10:20:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:20:18,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:18,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:18,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:20:18,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:18,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:18,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1661516742, now seen corresponding path program 2 times [2025-02-05 10:20:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400907805] [2025-02-05 10:20:18,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:20:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:18,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:20:18,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:20:18,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:20:18,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 10:20:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400907805] [2025-02-05 10:20:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400907805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641989564] [2025-02-05 10:20:18,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:20:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:18,542 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:18,545 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:18,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:20:18,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:20:18,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:20:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:18,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:20:18,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:20:18,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:20:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 10:20:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641989564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:20:18,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:20:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-02-05 10:20:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942528181] [2025-02-05 10:20:18,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:20:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:20:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:20:18,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:20:18,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:20:18,820 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:20:19,613 INFO L93 Difference]: Finished difference Result 259 states and 334 transitions. [2025-02-05 10:20:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 10:20:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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-02-05 10:20:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:20:19,617 INFO L225 Difference]: With dead ends: 259 [2025-02-05 10:20:19,617 INFO L226 Difference]: Without dead ends: 230 [2025-02-05 10:20:19,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 10:20:19,620 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 826 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:20:19,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 41 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:20:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-05 10:20:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 86. [2025-02-05 10:20:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2) internal successors, (102), 85 states have internal predecessors, (102), 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:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2025-02-05 10:20:19,652 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 20 [2025-02-05 10:20:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:20:19,652 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2025-02-05 10:20:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2025-02-05 10:20:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:20:19,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:20:19,653 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:20:19,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:20:19,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:19,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:20:19,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:20:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash -766663814, now seen corresponding path program 3 times [2025-02-05 10:20:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:20:19,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524566180] [2025-02-05 10:20:19,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:20:19,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:20:19,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 13 equivalence classes. [2025-02-05 10:20:20,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:20:20,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-05 10:20:20,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-05 10:20:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:20:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524566180] [2025-02-05 10:20:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524566180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:20:20,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370815789] [2025-02-05 10:20:20,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:20:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:20:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:20:20,516 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:20,519 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:20,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 13 equivalence classes. [2025-02-05 10:20:52,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 52 of 56 statements. [2025-02-05 10:20:52,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-05 10:20:52,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:20:52,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-05 10:20:52,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:20:52,435 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 1 [2025-02-05 10:20:52,530 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:52,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,578 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 30 [2025-02-05 10:20:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:52,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2025-02-05 10:20:52,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:52,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 66 [2025-02-05 10:20:52,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:52,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:52,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 84 [2025-02-05 10:20:53,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:53,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 102 [2025-02-05 10:20:53,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:53,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 120 [2025-02-05 10:20:53,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:53,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 121 treesize of output 138 [2025-02-05 10:20:59,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:59,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:20:59,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 156 [2025-02-05 10:21:20,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:21:20,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:21:20,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 151 treesize of output 174 [2025-02-05 10:21:31,524 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-05 10:21:31,525 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-05 10:21:31,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-02-05 10:21:31,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:21:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:31,727 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-05 10:21:31,732 INFO L158 Benchmark]: Toolchain (without parser) took 75497.42ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 110.4MB in the beginning and 261.6MB in the end (delta: -151.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-02-05 10:21:31,732 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:21:31,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 99.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:21:31,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.50ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:21:31,736 INFO L158 Benchmark]: Boogie Preprocessor took 41.85ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:21:31,736 INFO L158 Benchmark]: IcfgBuilder took 303.70ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 84.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:21:31,737 INFO L158 Benchmark]: TraceAbstraction took 74906.06ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 83.4MB in the beginning and 261.6MB in the end (delta: -178.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:21:31,738 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 99.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.50ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.85ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 303.70ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 84.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 74906.06ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 83.4MB in the beginning and 261.6MB in the end (delta: -178.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/transpose-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 44b06771d393671cf9550617b8bf478abc837489f84f20705c70efc1808f7508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:21:33,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:21:33,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 10:21:33,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:21:33,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:21:33,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:21:33,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:21:33,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:21:33,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:21:33,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:21:33,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:21:33,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:21:33,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:21:33,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:21:33,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:21:33,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:21:33,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:21:33,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:21:33,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:21:33,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:21:33,900 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 -> 44b06771d393671cf9550617b8bf478abc837489f84f20705c70efc1808f7508 [2025-02-05 10:21:34,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:21:34,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:21:34,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:21:34,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:21:34,209 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:21:34,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/transpose-u.c [2025-02-05 10:21:35,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6748ce06d/d2f2706be6b249bda60d78383df8447b/FLAG4b988d418 [2025-02-05 10:21:35,692 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:21:35,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/transpose-u.c [2025-02-05 10:21:35,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6748ce06d/d2f2706be6b249bda60d78383df8447b/FLAG4b988d418 [2025-02-05 10:21:35,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6748ce06d/d2f2706be6b249bda60d78383df8447b [2025-02-05 10:21:35,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:21:35,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:21:35,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:21:35,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:21:35,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:21:35,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9d24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35, skipping insertion in model container [2025-02-05 10:21:35,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:21:35,864 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/transpose-u.c[315,328] [2025-02-05 10:21:35,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:21:35,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:21:35,908 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/transpose-u.c[315,328] [2025-02-05 10:21:35,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:21:35,941 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:21:35,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35 WrapperNode [2025-02-05 10:21:35,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:21:35,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:21:35,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:21:35,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:21:35,949 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:21:35" (1/1) ... [2025-02-05 10:21:35,956 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:21:35" (1/1) ... [2025-02-05 10:21:35,972 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-02-05 10:21:35,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:21:35,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:21:35,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:21:35,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:21:35,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,999 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:21:35,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:35,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:21:36,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:21:36,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:21:36,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:21:36,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (1/1) ... [2025-02-05 10:21:36,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:21:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:36,049 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:21:36,052 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:21:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:21:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 10:21:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 10:21:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:21:36,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-05 10:21:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-05 10:21:36,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:21:36,164 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:21:36,392 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: 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_~#C~0#1.base, main_~#C~0#1.offset);havoc main_~#C~0#1.base, main_~#C~0#1.offset; [2025-02-05 10:21:36,404 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 10:21:36,404 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:21:36,411 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:21:36,411 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:21:36,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:21:36 BoogieIcfgContainer [2025-02-05 10:21:36,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:21:36,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:21:36,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:21:36,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:21:36,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:21:35" (1/3) ... [2025-02-05 10:21:36,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e2f8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:21:36, skipping insertion in model container [2025-02-05 10:21:36,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:21:35" (2/3) ... [2025-02-05 10:21:36,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e2f8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:21:36, skipping insertion in model container [2025-02-05 10:21:36,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:21:36" (3/3) ... [2025-02-05 10:21:36,422 INFO L128 eAbstractionObserver]: Analyzing ICFG transpose-u.c [2025-02-05 10:21:36,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:21:36,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transpose-u.c that has 1 procedures, 15 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-05 10:21:36,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:21:36,492 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;@5c0de692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:21:36,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:21:36,495 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-02-05 10:21:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 10:21:36,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:36,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:36,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:36,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1471514874, now seen corresponding path program 1 times [2025-02-05 10:21:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025926891] [2025-02-05 10:21:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:21:36,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:36,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:36,515 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:21:36,517 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:21:36,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 10:21:36,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 10:21:36,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:21:36,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:36,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:21:36,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:36,686 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:21:36,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:21:36,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025926891] [2025-02-05 10:21:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025926891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:21:36,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:21:36,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:21:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148063749] [2025-02-05 10:21:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:21:36,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:21:36,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:36,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:21:36,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:21:36,715 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-02-05 10:21:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:36,800 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2025-02-05 10:21:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:21:36,805 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-02-05 10:21:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:36,809 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:21:36,809 INFO L226 Difference]: Without dead ends: 14 [2025-02-05 10:21:36,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:21:36,815 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:36,816 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.1s Time] [2025-02-05 10:21:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-05 10:21:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-05 10:21:36,841 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-02-05 10:21:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-05 10:21:36,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 8 [2025-02-05 10:21:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-05 10:21:36,846 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-02-05 10:21:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2025-02-05 10:21:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 10:21:36,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:36,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:36,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:21:37,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:37,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1992313640, now seen corresponding path program 1 times [2025-02-05 10:21:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195829976] [2025-02-05 10:21:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:21:37,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:37,052 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:21:37,053 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:21:37,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 10:21:37,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 10:21:37,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:21:37,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:37,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:21:37,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:37,166 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:21:37,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:21:37,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195829976] [2025-02-05 10:21:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195829976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:21:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:21:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:21:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049660934] [2025-02-05 10:21:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:21:37,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:21:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:37,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:21:37,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:21:37,172 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-02-05 10:21:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:37,291 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2025-02-05 10:21:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:21:37,295 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-02-05 10:21:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:37,295 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:21:37,295 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:21:37,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:21:37,296 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:37,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:21:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:21:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-02-05 10:21:37,301 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-02-05 10:21:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-02-05 10:21:37,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-02-05 10:21:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:37,319 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-05 10:21:37,319 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-02-05 10:21:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-02-05 10:21:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:21:37,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:37,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:37,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:21:37,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:37,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:37,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1113605196, now seen corresponding path program 1 times [2025-02-05 10:21:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441774404] [2025-02-05 10:21:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:21:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:37,524 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:21:37,525 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:21:37,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:21:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:21:37,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:21:37,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:37,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:21:37,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:21:37,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:21:37,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441774404] [2025-02-05 10:21:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441774404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:21:37,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:21:37,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:21:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218798175] [2025-02-05 10:21:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:21:37,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:21:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:37,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:21:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:21:37,641 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-02-05 10:21:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:37,771 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2025-02-05 10:21:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:21:37,774 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:21:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:37,775 INFO L225 Difference]: With dead ends: 35 [2025-02-05 10:21:37,775 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:21:37,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:21:37,776 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:37,776 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.1s Time] [2025-02-05 10:21:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:21:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2025-02-05 10:21:37,780 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-02-05 10:21:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-02-05 10:21:37,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 11 [2025-02-05 10:21:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:37,781 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-02-05 10:21:37,781 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:21:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-02-05 10:21:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:21:37,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:37,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:37,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:21:37,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:37,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 475717754, now seen corresponding path program 1 times [2025-02-05 10:21:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910154301] [2025-02-05 10:21:37,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:21:37,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:37,985 INFO L229 MonitoredProcess]: Starting monitored process 5 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:21:37,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:21:38,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:21:38,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:21:38,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:21:38,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:21:38,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:21:38,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:21:38,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:38,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910154301] [2025-02-05 10:21:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910154301] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:21:38,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:21:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 10:21:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803200585] [2025-02-05 10:21:38,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:38,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:21:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:38,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:21:38,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:21:38,186 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-05 10:21:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:38,458 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-02-05 10:21:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:21:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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) Word has length 14 [2025-02-05 10:21:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:38,461 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:21:38,461 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:21:38,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:21:38,462 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 84 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:38,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 21 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:21:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:21:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-02-05 10:21:38,469 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-02-05 10:21:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-02-05 10:21:38,470 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 14 [2025-02-05 10:21:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:38,470 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-02-05 10:21:38,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-02-05 10:21:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-02-05 10:21:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:21:38,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:38,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:38,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:21:38,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:38,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:38,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1661516742, now seen corresponding path program 2 times [2025-02-05 10:21:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:38,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025810277] [2025-02-05 10:21:38,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:21:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:38,676 INFO L229 MonitoredProcess]: Starting monitored process 6 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:21:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:21:38,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:21:38,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:21:38,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:21:38,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:38,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:21:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 10:21:38,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 10:21:38,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025810277] [2025-02-05 10:21:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025810277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:21:38,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:21:38,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-05 10:21:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429563140] [2025-02-05 10:21:38,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:38,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:21:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:21:38,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:21:38,950 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:21:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:39,104 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-02-05 10:21:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:21:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-05 10:21:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:39,106 INFO L225 Difference]: With dead ends: 73 [2025-02-05 10:21:39,106 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 10:21:39,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:21:39,107 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:39,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:21:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 10:21:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-05 10:21:39,122 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-02-05 10:21:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-02-05 10:21:39,123 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 20 [2025-02-05 10:21:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:39,123 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-02-05 10:21:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:21:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-02-05 10:21:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 10:21:39,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:39,124 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:39,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:21:39,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:39,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:39,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -845042604, now seen corresponding path program 3 times [2025-02-05 10:21:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026083864] [2025-02-05 10:21:39,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:21:39,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:39,328 INFO L229 MonitoredProcess]: Starting monitored process 7 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:21:39,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:21:39,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 13 equivalence classes. [2025-02-05 10:21:39,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 12 of 38 statements. [2025-02-05 10:21:39,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 10:21:39,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:21:39,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:21:39,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:21:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-02-05 10:21:39,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:21:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-02-05 10:21:39,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:21:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026083864] [2025-02-05 10:21:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026083864] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:21:39,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:21:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 10:21:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099579044] [2025-02-05 10:21:39,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:21:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:21:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:21:39,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:21:39,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:21:39,650 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:21:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:21:39,915 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2025-02-05 10:21:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:21:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 10:21:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:21:39,917 INFO L225 Difference]: With dead ends: 133 [2025-02-05 10:21:39,918 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 10:21:39,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:21:39,918 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 141 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:21:39,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 25 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:21:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 10:21:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2025-02-05 10:21:39,938 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-02-05 10:21:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-02-05 10:21:39,939 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 38 [2025-02-05 10:21:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:21:39,939 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-02-05 10:21:39,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:21:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-02-05 10:21:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:21:39,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:21:39,940 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:21:39,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:21:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:40,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:21:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:21:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1216948218, now seen corresponding path program 4 times [2025-02-05 10:21:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:21:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1412745403] [2025-02-05 10:21:40,142 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:21:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:21:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:21:40,144 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21:40,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:21:40,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes.