./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.mul1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:31:39,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:31:39,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:31:39,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:31:39,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:31:39,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:31:39,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:31:39,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:31:39,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:31:39,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:31:39,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:31:39,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:31:39,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:31:39,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:31:39,694 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:31:39,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:31:39,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:31:39,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:31:39,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:31:39,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:31:39,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:31:39,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:31:39,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:31:39,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:31:39,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:31:39,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:31:39,697 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 [2025-02-07 23:31:39,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:31:39,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:31:39,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:31:39,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:31:39,961 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:31:39,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2025-02-07 23:31:41,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea602745/47edc8536f554f68b02bc88f19855ebf/FLAG378003309 [2025-02-07 23:31:41,493 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:31:41,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2025-02-07 23:31:41,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea602745/47edc8536f554f68b02bc88f19855ebf/FLAG378003309 [2025-02-07 23:31:41,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea602745/47edc8536f554f68b02bc88f19855ebf [2025-02-07 23:31:41,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:31:41,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:31:41,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:31:41,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:31:41,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:31:41,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:31:41" (1/1) ... [2025-02-07 23:31:41,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5383518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:41, skipping insertion in model container [2025-02-07 23:31:41,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:31:41" (1/1) ... [2025-02-07 23:31:41,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:31:41,984 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/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2025-02-07 23:31:42,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:31:42,071 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:31:42,081 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/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2025-02-07 23:31:42,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:31:42,134 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:31:42,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42 WrapperNode [2025-02-07 23:31:42,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:31:42,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:31:42,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:31:42,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:31:42,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,206 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 372 [2025-02-07 23:31:42,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:31:42,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:31:42,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:31:42,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:31:42,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,242 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:31:42,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:31:42,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:31:42,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:31:42,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:31:42,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (1/1) ... [2025-02-07 23:31:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:31:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:42,315 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 23:31:42,317 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 23:31:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:31:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:31:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:31:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:31:42,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:31:42,440 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:31:42,442 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:31:42,926 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-02-07 23:31:42,926 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:31:42,959 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:31:42,960 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:31:42,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:31:42 BoogieIcfgContainer [2025-02-07 23:31:42,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:31:42,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:31:42,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:31:42,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:31:42,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:31:41" (1/3) ... [2025-02-07 23:31:42,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f185e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:31:42, skipping insertion in model container [2025-02-07 23:31:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:42" (2/3) ... [2025-02-07 23:31:42,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f185e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:31:42, skipping insertion in model container [2025-02-07 23:31:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:31:42" (3/3) ... [2025-02-07 23:31:42,969 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul1.c [2025-02-07 23:31:42,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:31:42,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul1.c that has 1 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:31:43,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:31:43,030 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;@26dba107, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:31:43,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:31:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:31:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 23:31:43,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:43,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:31:43,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:43,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -120527702, now seen corresponding path program 1 times [2025-02-07 23:31:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653539971] [2025-02-07 23:31:43,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:43,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 23:31:43,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 23:31:43,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:43,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:43,645 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 23:31:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653539971] [2025-02-07 23:31:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653539971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:31:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326317507] [2025-02-07 23:31:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:31:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:43,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:31:43,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:43,674 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:31:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:43,792 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2025-02-07 23:31:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:31:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-07 23:31:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:43,801 INFO L225 Difference]: With dead ends: 151 [2025-02-07 23:31:43,802 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:31:43,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:43,811 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:43,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:31:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:31:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 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 23:31:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-07 23:31:43,845 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 30 [2025-02-07 23:31:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:43,845 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-07 23:31:43,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:31:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-07 23:31:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 23:31:43,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:43,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:31:43,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:31:43,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash 563287733, now seen corresponding path program 1 times [2025-02-07 23:31:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882525446] [2025-02-07 23:31:43,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:43,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 23:31:43,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 23:31:43,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:43,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:44,021 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 23:31:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:44,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882525446] [2025-02-07 23:31:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882525446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:31:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099409658] [2025-02-07 23:31:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:31:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:44,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:31:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:44,025 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:31:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:44,121 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2025-02-07 23:31:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:31:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-07 23:31:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:44,123 INFO L225 Difference]: With dead ends: 153 [2025-02-07 23:31:44,123 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 23:31:44,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:44,124 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:44,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 23:31:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-07 23:31:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 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 23:31:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-02-07 23:31:44,137 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 31 [2025-02-07 23:31:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-02-07 23:31:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:31:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-02-07 23:31:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 23:31:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:44,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:31:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:31:44,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2081407483, now seen corresponding path program 1 times [2025-02-07 23:31:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254839397] [2025-02-07 23:31:44,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:44,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 23:31:44,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 23:31:44,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:44,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:44,425 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 23:31:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254839397] [2025-02-07 23:31:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254839397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:44,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:31:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914016051] [2025-02-07 23:31:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:31:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:31:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:44,428 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 23:31:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:44,519 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2025-02-07 23:31:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:31:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 23:31:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:44,522 INFO L225 Difference]: With dead ends: 153 [2025-02-07 23:31:44,522 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:31:44,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:31:44,523 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 108 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:44,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 207 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:31:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:31:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 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 23:31:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-02-07 23:31:44,531 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 32 [2025-02-07 23:31:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:44,531 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-02-07 23:31:44,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 23:31:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-02-07 23:31:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 23:31:44,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:44,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:31:44,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:31:44,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash -577219111, now seen corresponding path program 1 times [2025-02-07 23:31:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518011598] [2025-02-07 23:31:44,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:44,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 23:31:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 23:31:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:31:44,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:31:44,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 23:31:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 23:31:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:31:44,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:31:44,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:31:44,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:31:44,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:31:44,629 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:31:44,659 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:31:44,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:31:44,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:31:44 BoogieIcfgContainer [2025-02-07 23:31:44,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:31:44,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:31:44,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:31:44,673 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:31:44,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:31:42" (3/4) ... [2025-02-07 23:31:44,676 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:31:44,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:31:44,678 INFO L158 Benchmark]: Toolchain (without parser) took 2851.37ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 133.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2025-02-07 23:31:44,678 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:31:44,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.97ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 141.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:31:44,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.15ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 137.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:31:44,680 INFO L158 Benchmark]: Boogie Preprocessor took 72.65ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 133.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:31:44,680 INFO L158 Benchmark]: IcfgBuilder took 678.96ms. Allocated memory is still 201.3MB. Free memory was 133.8MB in the beginning and 92.3MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 23:31:44,681 INFO L158 Benchmark]: TraceAbstraction took 1710.02ms. Allocated memory is still 201.3MB. Free memory was 91.5MB in the beginning and 133.5MB in the end (delta: -42.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:31:44,681 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:31:44,682 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.24ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.97ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 141.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.15ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 137.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.65ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 133.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 678.96ms. Allocated memory is still 201.3MB. Free memory was 133.8MB in the beginning and 92.3MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1710.02ms. Allocated memory is still 201.3MB. Free memory was 91.5MB in the beginning and 133.5MB in the end (delta: -42.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 133.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 91. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 64); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (64 - 1); [L35] const SORT_9 var_10 = 0; [L36] const SORT_1 var_18 = 1; [L37] const SORT_5 var_22 = 0; [L39] SORT_1 input_2; [L40] SORT_1 input_3; [L41] SORT_1 input_4; [L42] SORT_5 input_6; [L43] SORT_5 input_7; [L44] SORT_1 input_8; [L46] EXPR __VERIFIER_nondet_ulong() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L46] SORT_9 state_11 = __VERIFIER_nondet_ulong() & mask_SORT_9; [L47] EXPR __VERIFIER_nondet_ulong() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L47] SORT_9 state_13 = __VERIFIER_nondet_ulong() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L48] SORT_5 state_23 = __VERIFIER_nondet_uint() & mask_SORT_5; [L49] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L49] SORT_5 state_25 = __VERIFIER_nondet_uint() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L50] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L51] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L52] SORT_5 state_31 = __VERIFIER_nondet_uint() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L53] SORT_5 state_33 = __VERIFIER_nondet_uint() & mask_SORT_5; [L55] SORT_9 init_12_arg_1 = var_10; [L56] state_11 = init_12_arg_1 [L57] SORT_9 init_14_arg_1 = var_10; [L58] state_13 = init_14_arg_1 [L59] SORT_5 init_24_arg_1 = var_22; [L60] state_23 = init_24_arg_1 [L61] SORT_5 init_26_arg_1 = var_22; [L62] state_25 = init_26_arg_1 [L63] SORT_1 init_28_arg_1 = var_18; [L64] state_27 = init_28_arg_1 [L65] SORT_1 init_30_arg_1 = var_18; [L66] state_29 = init_30_arg_1 [L67] SORT_5 init_32_arg_1 = var_22; [L68] state_31 = init_32_arg_1 [L69] SORT_5 init_34_arg_1 = var_22; [L70] state_33 = init_34_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L73] input_2 = __VERIFIER_nondet_uchar() [L74] input_3 = __VERIFIER_nondet_uchar() [L75] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L75] input_3 = input_3 & mask_SORT_1 [L76] input_4 = __VERIFIER_nondet_uchar() [L77] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L77] input_4 = input_4 & mask_SORT_1 [L78] input_6 = __VERIFIER_nondet_uint() [L79] input_7 = __VERIFIER_nondet_uint() [L80] input_8 = __VERIFIER_nondet_uchar() [L81] EXPR input_8 & mask_SORT_1 VAL [input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L81] input_8 = input_8 & mask_SORT_1 [L84] SORT_9 var_15_arg_0 = state_11; [L85] SORT_9 var_15_arg_1 = state_13; [L86] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L87] SORT_1 var_19_arg_0 = var_15; [L88] SORT_1 var_19 = ~var_19_arg_0; [L89] SORT_1 var_20_arg_0 = var_18; [L90] SORT_1 var_20_arg_1 = var_19; VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_22=0] [L91] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L91] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L92] EXPR var_20 & mask_SORT_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L92] var_20 = var_20 & mask_SORT_1 [L93] SORT_1 bad_21_arg_0 = var_20; [L94] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 322 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:31:44,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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/hardware-verification-bv/btor2c-lazyMod.mul1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:31:46,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:31:46,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:31:46,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:31:46,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:31:47,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:31:47,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:31:47,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:31:47,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:31:47,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:31:47,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:31:47,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:31:47,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:31:47,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:31:47,006 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:31:47,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:31:47,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:31:47,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:31:47,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:31:47,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:31:47,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:31:47,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:31:47,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:31:47,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:31:47,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:31:47,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:31:47,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:31:47,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:31:47,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:31:47,009 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:31:47,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:31:47,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:31:47,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:31:47,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:31:47,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:31:47,010 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0acb12ce5c1df780b96c69890f213c2ccd377bcb999df28d010d244cee6d0555 [2025-02-07 23:31:47,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:31:47,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:31:47,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:31:47,310 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:31:47,311 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:31:47,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2025-02-07 23:31:48,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a99fdf55/75ba5fb0326a44b9be35b3ecceb0faa6/FLAG5f2edbaef [2025-02-07 23:31:48,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:31:48,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul1.c [2025-02-07 23:31:48,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a99fdf55/75ba5fb0326a44b9be35b3ecceb0faa6/FLAG5f2edbaef [2025-02-07 23:31:48,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a99fdf55/75ba5fb0326a44b9be35b3ecceb0faa6 [2025-02-07 23:31:48,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:31:48,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:31:48,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:31:48,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:31:48,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:31:48,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:31:48" (1/1) ... [2025-02-07 23:31:48,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dddae6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:48, skipping insertion in model container [2025-02-07 23:31:48,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:31:48" (1/1) ... [2025-02-07 23:31:48,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:31:49,000 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/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2025-02-07 23:31:49,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:31:49,088 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:31:49,100 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/hardware-verification-bv/btor2c-lazyMod.mul1.c[1244,1257] [2025-02-07 23:31:49,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:31:49,151 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:31:49,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49 WrapperNode [2025-02-07 23:31:49,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:31:49,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:31:49,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:31:49,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:31:49,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,204 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 204 [2025-02-07 23:31:49,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:31:49,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:31:49,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:31:49,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:31:49,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,239 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:31:49,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:31:49,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:31:49,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:31:49,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:31:49,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (1/1) ... [2025-02-07 23:31:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:31:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:49,304 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 23:31:49,311 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 23:31:49,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:31:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:31:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 23:31:49,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:31:49,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:31:49,428 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:31:49,430 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:31:49,700 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-07 23:31:49,700 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:31:49,710 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:31:49,710 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:31:49,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:31:49 BoogieIcfgContainer [2025-02-07 23:31:49,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:31:49,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:31:49,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:31:49,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:31:49,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:31:48" (1/3) ... [2025-02-07 23:31:49,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870ba7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:31:49, skipping insertion in model container [2025-02-07 23:31:49,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:31:49" (2/3) ... [2025-02-07 23:31:49,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870ba7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:31:49, skipping insertion in model container [2025-02-07 23:31:49,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:31:49" (3/3) ... [2025-02-07 23:31:49,722 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul1.c [2025-02-07 23:31:49,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:31:49,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.mul1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:31:49,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:31:49,784 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;@2d9ce47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:31:49,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:31:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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 23:31:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:31:49,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:49,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:31:49,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:31:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:31:49,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57811825] [2025-02-07 23:31:49,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:49,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:49,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:49,818 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 23:31:49,820 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 23:31:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:31:49,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:31:49,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:49,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:49,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:31:49,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:50,127 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 23:31:50,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:31:50,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:31:50,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57811825] [2025-02-07 23:31:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57811825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:50,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:31:50,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440164676] [2025-02-07 23:31:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:50,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:31:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:31:50,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:31:50,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:50,153 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 23:31:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:50,218 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:31:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:31:50,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-07 23:31:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:50,225 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:31:50,225 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:31:50,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:31:50,230 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:50,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:31:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:31:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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-07 23:31:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:31:50,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:31:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:31:50,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 23:31:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:31:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:31:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:50,255 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:31:50,263 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 23:31:50,456 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-07 23:31:50,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:50,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:31:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:31:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463872243] [2025-02-07 23:31:50,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:50,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:50,459 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 23:31:50,460 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 23:31:50,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:31:50,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:31:50,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:50,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:50,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 23:31:50,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:51,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:32:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:32:00,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:32:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463872243] [2025-02-07 23:32:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463872243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:32:00,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:32:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-02-07 23:32:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451881038] [2025-02-07 23:32:00,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:32:00,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:32:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:32:00,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:32:00,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:32:00,886 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:32:03,309 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:32:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:32:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:32:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:32:03,334 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:32:03,334 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:32:03,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:32:03,335 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:32:03,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 23:32:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:32:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:32:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-07 23:32:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:32:03,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:32:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:32:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:32:03,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:32:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:32:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:32:03,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:32:03,341 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:32:03,353 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 23:32:03,542 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-07 23:32:03,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:32:03,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:32:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:32:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:32:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664261421] [2025-02-07 23:32:03,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:32:03,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:32:03,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:32:03,545 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 23:32:03,547 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 23:32:03,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes.