./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 48c9605d 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-?-48c9605-m [2025-02-07 17:10:55,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:10:55,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:10:55,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:10:55,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:10:55,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:10:55,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:10:55,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:10:55,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:10:55,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:10:55,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:10:55,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:10:55,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:10:55,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:10:55,191 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:10:55,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:10:55,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:10:55,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:10:55,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:10:55,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:10:55,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:10:55,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:10:55,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:10:55,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:10:55,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:10:55,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:10:55,195 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-07 17:10:55,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:10:55,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:10:55,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:10:55,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:10:55,472 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:10:55,473 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-07 17:10:56,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad9517c2/1a85d12f4a0047f384d7c0201d0dc5a7/FLAG555079163 [2025-02-07 17:10:56,893 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:10:56,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/transpose-u.c [2025-02-07 17:10:56,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad9517c2/1a85d12f4a0047f384d7c0201d0dc5a7/FLAG555079163 [2025-02-07 17:10:57,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cad9517c2/1a85d12f4a0047f384d7c0201d0dc5a7 [2025-02-07 17:10:57,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:10:57,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:10:57,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:10:57,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:10:57,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:10:57,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4dacf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57, skipping insertion in model container [2025-02-07 17:10:57,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:10:57,353 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-07 17:10:57,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:10:57,380 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:10:57,389 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-07 17:10:57,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:10:57,413 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:10:57,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57 WrapperNode [2025-02-07 17:10:57,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:10:57,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:10:57,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:10:57,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:10:57,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,444 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-02-07 17:10:57,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:10:57,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:10:57,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:10:57,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:10:57,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,471 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-07 17:10:57,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:10:57,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:10:57,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:10:57,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:10:57,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (1/1) ... [2025-02-07 17:10:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:10:57,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:57,522 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-07 17:10:57,528 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-07 17:10:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:10:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:10:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:10:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:10:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:10:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:10:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:10:57,621 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:10:57,623 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:10:57,749 INFO L1324 $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-07 17:10:57,756 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-07 17:10:57,756 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:10:57,763 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:10:57,763 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:10:57,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:10:57 BoogieIcfgContainer [2025-02-07 17:10:57,763 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:10:57,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:10:57,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:10:57,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:10:57,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:10:57" (1/3) ... [2025-02-07 17:10:57,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea7ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:10:57, skipping insertion in model container [2025-02-07 17:10:57,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:10:57" (2/3) ... [2025-02-07 17:10:57,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea7ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:10:57, skipping insertion in model container [2025-02-07 17:10:57,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:10:57" (3/3) ... [2025-02-07 17:10:57,772 INFO L128 eAbstractionObserver]: Analyzing ICFG transpose-u.c [2025-02-07 17:10:57,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:10:57,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transpose-u.c that has 1 procedures, 14 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-07 17:10:57,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:10:57,848 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;@914065f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:10:57,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:10:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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-07 17:10:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:10:57,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:57,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:57,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1512466291, now seen corresponding path program 1 times [2025-02-07 17:10:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:57,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735163717] [2025-02-07 17:10:57,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:57,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:10:57,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:10:57,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:57,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:58,044 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-07 17:10:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:58,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735163717] [2025-02-07 17:10:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735163717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:10:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:10:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:10:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062494791] [2025-02-07 17:10:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:10:58,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:10:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:58,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:10:58,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:10:58,071 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 17:10:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:58,125 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2025-02-07 17:10:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:10:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-07 17:10:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:58,134 INFO L225 Difference]: With dead ends: 27 [2025-02-07 17:10:58,134 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:10:58,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:10:58,140 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 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-07 17:10:58,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:10:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:10:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-07 17:10:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-02-07 17:10:58,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 7 [2025-02-07 17:10:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-07 17:10:58,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-07 17:10:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2025-02-07 17:10:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:10:58,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:58,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:10:58,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -560059477, now seen corresponding path program 1 times [2025-02-07 17:10:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177081872] [2025-02-07 17:10:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:10:58,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:10:58,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:58,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:58,270 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-07 17:10:58,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:58,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177081872] [2025-02-07 17:10:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177081872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:10:58,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:10:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:10:58,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258106494] [2025-02-07 17:10:58,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:10:58,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:10:58,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:58,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:10:58,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:10:58,273 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:58,317 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2025-02-07 17:10:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:10:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 17:10:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:58,319 INFO L225 Difference]: With dead ends: 29 [2025-02-07 17:10:58,319 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 17:10:58,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:10:58,320 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 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-07 17:10:58,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:10:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 17:10:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2025-02-07 17:10:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-07 17:10:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-02-07 17:10:58,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2025-02-07 17:10:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-02-07 17:10:58,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-02-07 17:10:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 17:10:58,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:58,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:10:58,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1731156007, now seen corresponding path program 1 times [2025-02-07 17:10:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574355010] [2025-02-07 17:10:58,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 17:10:58,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 17:10:58,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:58,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:58,426 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-07 17:10:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574355010] [2025-02-07 17:10:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574355010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:10:58,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:10:58,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:10:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870904490] [2025-02-07 17:10:58,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:10:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:10:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:58,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:10:58,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:10:58,428 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-07 17:10:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:58,480 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-02-07 17:10:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:10:58,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-07 17:10:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:58,481 INFO L225 Difference]: With dead ends: 34 [2025-02-07 17:10:58,481 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 17:10:58,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:10:58,484 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:58,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:10:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 17:10:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2025-02-07 17:10:58,490 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-07 17:10:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-02-07 17:10:58,490 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2025-02-07 17:10:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-02-07 17:10:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-07 17:10:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2025-02-07 17:10:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:10:58,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:58,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:10:58,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:58,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 489403853, now seen corresponding path program 1 times [2025-02-07 17:10:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926124412] [2025-02-07 17:10:58,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:58,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:10:58,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:10:58,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:58,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:58,634 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-07 17:10:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926124412] [2025-02-07 17:10:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926124412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2511125] [2025-02-07 17:10:58,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:10:58,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:58,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:58,639 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-07 17:10:58,641 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-07 17:10:58,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:10:58,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:10:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:58,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:10:58,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:58,776 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-07 17:10:58,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:58,814 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-07 17:10:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2511125] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:58,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:10:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123043406] [2025-02-07 17:10:58,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:10:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:10:58,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:10:58,817 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-07 17:10:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:58,930 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2025-02-07 17:10:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:10:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 17:10:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:58,932 INFO L225 Difference]: With dead ends: 51 [2025-02-07 17:10:58,932 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 17:10:58,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 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-07 17:10:58,934 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:58,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 16 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 17:10:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-02-07 17:10:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-07 17:10:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-02-07 17:10:58,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 13 [2025-02-07 17:10:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:58,947 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-02-07 17:10:58,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-07 17:10:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-02-07 17:10:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 17:10:58,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:58,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:10:58,956 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-07 17:10:59,153 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-07 17:10:59,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2008649549, now seen corresponding path program 2 times [2025-02-07 17:10:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486227968] [2025-02-07 17:10:59,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:10:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:59,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:10:59,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:10:59,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:10:59,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:59,248 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-07 17:10:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486227968] [2025-02-07 17:10:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486227968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195369687] [2025-02-07 17:10:59,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:10:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:59,251 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-07 17:10:59,254 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-07 17:10:59,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:10:59,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:10:59,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:10:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:59,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:10:59,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:59,409 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-07 17:10:59,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:59,500 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-07 17:10:59,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195369687] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:59,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:59,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2025-02-07 17:10:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86967825] [2025-02-07 17:10:59,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:10:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:59,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:10:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:10:59,505 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:11:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:11:00,198 INFO L93 Difference]: Finished difference Result 258 states and 333 transitions. [2025-02-07 17:11:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:11:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 17:11:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:11:00,200 INFO L225 Difference]: With dead ends: 258 [2025-02-07 17:11:00,200 INFO L226 Difference]: Without dead ends: 229 [2025-02-07 17:11:00,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 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-07 17:11:00,202 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 459 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:11:00,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 37 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:11:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-07 17:11:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 85. [2025-02-07 17:11:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 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-07 17:11:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-07 17:11:00,230 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 19 [2025-02-07 17:11:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:11:00,230 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-07 17:11:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:11:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-07 17:11:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 17:11:00,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:11:00,232 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:11:00,240 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-07 17:11:00,433 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-07 17:11:00,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:11:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:11:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1803869939, now seen corresponding path program 3 times [2025-02-07 17:11:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:11:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828456172] [2025-02-07 17:11:00,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:11:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:11:00,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 13 equivalence classes. [2025-02-07 17:11:00,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 17:11:00,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-07 17:11:00,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:11:01,043 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-07 17:11:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:11:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828456172] [2025-02-07 17:11:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828456172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:11:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203491843] [2025-02-07 17:11:01,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:11:01,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:11:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:11:01,047 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-07 17:11:01,048 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-07 17:11:01,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 13 equivalence classes. [2025-02-07 17:11:20,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 51 of 55 statements. [2025-02-07 17:11:20,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-02-07 17:11:20,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:11:20,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-02-07 17:11:20,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:11:20,933 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-07 17:11:21,012 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-07 17:11:21,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:21,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 17:11:21,671 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:21,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-02-07 17:11:21,778 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:21,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:21,892 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:21,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,000 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,149 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,255 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,366 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,476 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,592 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:22,726 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-07 17:11:22,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-07 17:11:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 36 proven. 238 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-02-07 17:11:23,062 INFO L312 TraceCheckSpWp]: Computing backward predicates...