./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:28:04,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:28:04,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:28:04,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:28:04,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:28:04,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:28:04,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:28:04,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:28:04,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:28:04,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:28:04,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:28:04,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:28:04,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:28:04,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:28:04,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:28:04,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:28:04,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:28:04,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:28:04,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:28:04,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:28:04,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:28:04,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:28:04,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:28:04,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:28:04,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:28:04,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:28:04,597 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-02-07 17:28:04,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:28:04,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:28:04,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:28:04,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:28:04,862 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:28:04,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-02-07 17:28:06,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42655f523/a8485ad36cad4a6fa4220a70a3d56f52/FLAG328cb1ecc [2025-02-07 17:28:06,346 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:28:06,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-02-07 17:28:06,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42655f523/a8485ad36cad4a6fa4220a70a3d56f52/FLAG328cb1ecc [2025-02-07 17:28:06,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42655f523/a8485ad36cad4a6fa4220a70a3d56f52 [2025-02-07 17:28:06,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:28:06,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:28:06,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:28:06,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:28:06,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:28:06,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06, skipping insertion in model container [2025-02-07 17:28:06,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:28:06,806 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/bitvector/num_conversion_2.c[685,698] [2025-02-07 17:28:06,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:28:06,837 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:28:06,845 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/bitvector/num_conversion_2.c[685,698] [2025-02-07 17:28:06,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:28:06,864 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:28:06,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06 WrapperNode [2025-02-07 17:28:06,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:28:06,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:28:06,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:28:06,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:28:06,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,893 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-02-07 17:28:06,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:28:06,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:28:06,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:28:06,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:28:06,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,917 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 17:28:06,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:28:06,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:28:06,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:28:06,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:28:06,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (1/1) ... [2025-02-07 17:28:06,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:28:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:06,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:28:06,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:28:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:28:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:28:06,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:28:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:28:07,023 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:28:07,025 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:28:07,172 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 17:28:07,173 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:28:07,198 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:28:07,198 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:28:07,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:28:07 BoogieIcfgContainer [2025-02-07 17:28:07,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:28:07,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:28:07,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:28:07,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:28:07,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:28:06" (1/3) ... [2025-02-07 17:28:07,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2398c37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:28:07, skipping insertion in model container [2025-02-07 17:28:07,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:06" (2/3) ... [2025-02-07 17:28:07,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2398c37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:28:07, skipping insertion in model container [2025-02-07 17:28:07,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:28:07" (3/3) ... [2025-02-07 17:28:07,208 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-02-07 17:28:07,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:28:07,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 17:28:07,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:28:07,286 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;@5cccdd5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:28:07,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:28:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 17:28:07,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:07,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 17:28:07,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:07,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1583823, now seen corresponding path program 1 times [2025-02-07 17:28:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405372175] [2025-02-07 17:28:07,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:07,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 17:28:07,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 17:28:07,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:07,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405372175] [2025-02-07 17:28:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405372175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:28:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173444828] [2025-02-07 17:28:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:28:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:07,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:28:07,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:28:07,544 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:07,585 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2025-02-07 17:28:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:28:07,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:07,593 INFO L225 Difference]: With dead ends: 42 [2025-02-07 17:28:07,593 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 17:28:07,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:28:07,599 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:07,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 17:28:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2025-02-07 17:28:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 17:28:07,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 4 [2025-02-07 17:28:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 17:28:07,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 17:28:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:28:07,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:07,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:28:07,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1421661831, now seen corresponding path program 1 times [2025-02-07 17:28:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374324394] [2025-02-07 17:28:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:07,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:28:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:28:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:07,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374324394] [2025-02-07 17:28:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374324394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:28:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799114763] [2025-02-07 17:28:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:07,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:28:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:07,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:28:07,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:28:07,785 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:07,808 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-02-07 17:28:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:28:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:28:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:07,809 INFO L225 Difference]: With dead ends: 31 [2025-02-07 17:28:07,809 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 17:28:07,809 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 17:28:07,810 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:07,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 17:28:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 17:28:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 17:28:07,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-02-07 17:28:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:07,814 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 17:28:07,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 17:28:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:28:07,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:07,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:07,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:28:07,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1422585352, now seen corresponding path program 1 times [2025-02-07 17:28:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644373291] [2025-02-07 17:28:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:07,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:28:07,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:28:07,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:07,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644373291] [2025-02-07 17:28:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644373291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849760199] [2025-02-07 17:28:07,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:07,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:07,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:28:07,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:28:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:28:07,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:07,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 17:28:08,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:08,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849760199] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 6] total 14 [2025-02-07 17:28:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815118244] [2025-02-07 17:28:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:08,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:28:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:08,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:28:08,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:28:08,424 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 17:28:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:08,641 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-02-07 17:28:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:28:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:28:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:08,642 INFO L225 Difference]: With dead ends: 33 [2025-02-07 17:28:08,642 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 17:28:08,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:28:08,643 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:08,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:28:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 17:28:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-07 17:28:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-07 17:28:08,648 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2025-02-07 17:28:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:08,648 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-07 17:28:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 17:28:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-07 17:28:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:28:08,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:08,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:08,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:28:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1215785481, now seen corresponding path program 1 times [2025-02-07 17:28:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259113249] [2025-02-07 17:28:08,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:08,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:28:08,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:28:08,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259113249] [2025-02-07 17:28:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259113249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618051651] [2025-02-07 17:28:08,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:08,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:08,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:28:08,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:28:08,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:28:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:08,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:08,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 17:28:08,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:09,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:28:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618051651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:09,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:28:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2025-02-07 17:28:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184351688] [2025-02-07 17:28:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:28:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:09,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:28:09,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:28:09,049 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:09,097 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2025-02-07 17:28:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:28:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2025-02-07 17:28:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:09,099 INFO L225 Difference]: With dead ends: 66 [2025-02-07 17:28:09,099 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 17:28:09,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:28:09,100 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:09,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 17:28:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2025-02-07 17:28:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-07 17:28:09,106 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 12 [2025-02-07 17:28:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-07 17:28:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-07 17:28:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 17:28:09,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:09,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:09,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:28:09,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:09,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:09,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1538108491, now seen corresponding path program 1 times [2025-02-07 17:28:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73338099] [2025-02-07 17:28:09,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:09,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 17:28:09,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:28:09,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73338099] [2025-02-07 17:28:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73338099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550971633] [2025-02-07 17:28:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:09,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:09,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:28:09,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 17:28:09,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:28:09,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:09,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:09,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 17:28:09,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:09,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550971633] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:09,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:28:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 17 [2025-02-07 17:28:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153211040] [2025-02-07 17:28:09,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:09,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 17:28:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:09,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 17:28:09,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-02-07 17:28:09,894 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:10,422 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2025-02-07 17:28:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 17:28:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 17:28:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:10,424 INFO L225 Difference]: With dead ends: 160 [2025-02-07 17:28:10,424 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 17:28:10,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:28:10,425 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 173 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:10,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 104 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:28:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 17:28:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2025-02-07 17:28:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2025-02-07 17:28:10,435 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 19 [2025-02-07 17:28:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:10,435 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2025-02-07 17:28:10,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2025-02-07 17:28:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:28:10,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:10,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:10,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:28:10,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:10,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:10,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash 369731153, now seen corresponding path program 1 times [2025-02-07 17:28:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855835831] [2025-02-07 17:28:10,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:10,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 17:28:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:28:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855835831] [2025-02-07 17:28:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855835831] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142248619] [2025-02-07 17:28:10,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:10,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:10,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:28:10,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 17:28:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:28:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:10,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:10,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 17:28:10,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:28:11,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:28:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142248619] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:11,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:28:11,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 15 [2025-02-07 17:28:11,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500859305] [2025-02-07 17:28:11,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:11,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:28:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:11,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:28:11,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:28:11,405 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:12,194 INFO L93 Difference]: Finished difference Result 390 states and 514 transitions. [2025-02-07 17:28:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-07 17:28:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 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 28 [2025-02-07 17:28:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:12,198 INFO L225 Difference]: With dead ends: 390 [2025-02-07 17:28:12,198 INFO L226 Difference]: Without dead ends: 338 [2025-02-07 17:28:12,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 17:28:12,200 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 365 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:12,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 185 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:28:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-07 17:28:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 229. [2025-02-07 17:28:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.3157894736842106) internal successors, (300), 228 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2025-02-07 17:28:12,234 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 28 [2025-02-07 17:28:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:12,235 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2025-02-07 17:28:12,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2025-02-07 17:28:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 17:28:12,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:12,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:12,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 17:28:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-07 17:28:12,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -399730817, now seen corresponding path program 1 times [2025-02-07 17:28:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085273593] [2025-02-07 17:28:12,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:12,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 17:28:12,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 17:28:12,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:12,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 17:28:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085273593] [2025-02-07 17:28:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085273593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:28:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777928715] [2025-02-07 17:28:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:12,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:28:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:12,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:28:12,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:28:12,576 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:12,611 INFO L93 Difference]: Finished difference Result 443 states and 586 transitions. [2025-02-07 17:28:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:28:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-07 17:28:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:12,613 INFO L225 Difference]: With dead ends: 443 [2025-02-07 17:28:12,613 INFO L226 Difference]: Without dead ends: 249 [2025-02-07 17:28:12,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:28:12,614 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:12,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-07 17:28:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2025-02-07 17:28:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 232 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 296 transitions. [2025-02-07 17:28:12,637 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 296 transitions. Word has length 36 [2025-02-07 17:28:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:12,638 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 296 transitions. [2025-02-07 17:28:12,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 296 transitions. [2025-02-07 17:28:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 17:28:12,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:12,639 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 17:28:12,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 17:28:12,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1884327999, now seen corresponding path program 2 times [2025-02-07 17:28:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:12,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858876915] [2025-02-07 17:28:12,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:28:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:12,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:28:12,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 17:28:12,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:28:12,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:28:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858876915] [2025-02-07 17:28:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858876915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:28:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430192571] [2025-02-07 17:28:12,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:28:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:12,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:12,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:28:12,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:28:12,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 17:28:12,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:28:12,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 17:28:12,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:13,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430192571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:13,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:28:13,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 24 [2025-02-07 17:28:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767263279] [2025-02-07 17:28:13,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 17:28:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:28:13,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 17:28:13,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:28:13,327 INFO L87 Difference]: Start difference. First operand 233 states and 296 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:13,950 INFO L93 Difference]: Finished difference Result 657 states and 851 transitions. [2025-02-07 17:28:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 17:28:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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 37 [2025-02-07 17:28:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:13,953 INFO L225 Difference]: With dead ends: 657 [2025-02-07 17:28:13,953 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 17:28:13,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=839, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 17:28:13,955 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 262 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:13,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 354 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:28:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 17:28:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 396. [2025-02-07 17:28:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.2759493670886075) internal successors, (504), 395 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2025-02-07 17:28:13,972 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 37 [2025-02-07 17:28:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2025-02-07 17:28:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2025-02-07 17:28:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:28:13,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:13,975 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 17:28:13,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 17:28:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:14,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 594359693, now seen corresponding path program 3 times [2025-02-07 17:28:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:28:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006160289] [2025-02-07 17:28:14,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:28:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:28:14,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 9 equivalence classes. [2025-02-07 17:28:14,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:28:14,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 17:28:14,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 17:28:14,220 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 17:28:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:28:14,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:28:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 17:28:14,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 17:28:14,270 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 17:28:14,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 17:28:14,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 17:28:14,275 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:14,301 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 17:28:14,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 05:28:14 BoogieIcfgContainer [2025-02-07 17:28:14,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 17:28:14,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 17:28:14,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 17:28:14,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 17:28:14,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:28:07" (3/4) ... [2025-02-07 17:28:14,307 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 17:28:14,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 17:28:14,308 INFO L158 Benchmark]: Toolchain (without parser) took 7646.94ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 119.5MB in the end (delta: 34.9MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-02-07 17:28:14,309 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:28:14,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.81ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 143.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:28:14,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 141.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:28:14,309 INFO L158 Benchmark]: Boogie Preprocessor took 28.11ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 140.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:28:14,309 INFO L158 Benchmark]: IcfgBuilder took 275.90ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 127.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:28:14,310 INFO L158 Benchmark]: TraceAbstraction took 7102.91ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 121.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2025-02-07 17:28:14,310 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 119.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:28:14,311 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.23ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.81ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 143.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 141.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.11ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 140.6MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 275.90ms. Allocated memory is still 201.3MB. Free memory was 140.6MB in the beginning and 127.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7102.91ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 121.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 201.3MB. Free memory was 121.5MB in the beginning and 119.5MB in the end (delta: 1.9MB). 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: 16]: 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 shiftLeft at line 31. Possible FailurePath: [L24] unsigned char x = __VERIFIER_nondet_uchar(); [L25] unsigned char y; [L26] unsigned char c; [L28] y = 0 [L29] c = 0 VAL [c=0, y=0] [L30] COND TRUE c < (unsigned char)8 VAL [c=0, y=0] [L31] EXPR ((unsigned char)1) << c VAL [c=0, y=0] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=0, i=1, x=1, y=0] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=0, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=1, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=1, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=1, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=2, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=2, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=2, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=3, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=3, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=3, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=4, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=4, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=4, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=5, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=5, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=5, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=6, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=6, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=6, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=7, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=7, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=7, i=257, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=7, x=1, y=2] [L36] c = c + ((unsigned char)1) [L30] COND FALSE !(c < (unsigned char)8) [L38] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 891 mSDsluCounter, 798 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1387 IncrementalHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 139 mSDtfsCounter, 1387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=8, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 314 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295 SizeOfPredicates, 16 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 94/307 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 17:28:14,325 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/bitvector/num_conversion_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:28:16,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:28:16,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 17:28:16,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:28:16,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:28:16,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:28:16,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:28:16,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:28:16,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:28:16,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:28:16,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:28:16,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:28:16,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:28:16,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:28:16,783 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:28:16,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:28:16,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:28:16,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:28:16,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:28:16,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 17:28:16,784 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:28:16,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:28:16,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:28:16,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:28:16,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:28:16,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:28:16,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:28:16,786 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:28:16,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:28:16,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:28:16,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2025-02-07 17:28:17,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:28:17,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:28:17,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:28:17,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:28:17,054 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:28:17,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2025-02-07 17:28:18,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d995022fc/43b1fd6263a247d9bff8845a2121e51c/FLAG20390bbbe [2025-02-07 17:28:18,585 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:28:18,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2025-02-07 17:28:18,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d995022fc/43b1fd6263a247d9bff8845a2121e51c/FLAG20390bbbe [2025-02-07 17:28:18,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d995022fc/43b1fd6263a247d9bff8845a2121e51c [2025-02-07 17:28:18,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:28:18,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:28:18,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:28:18,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:28:18,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:28:18,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18af18d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18, skipping insertion in model container [2025-02-07 17:28:18,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:28:18,774 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/bitvector/num_conversion_2.c[685,698] [2025-02-07 17:28:18,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:28:18,807 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:28:18,817 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/bitvector/num_conversion_2.c[685,698] [2025-02-07 17:28:18,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:28:18,839 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:28:18,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18 WrapperNode [2025-02-07 17:28:18,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:28:18,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:28:18,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:28:18,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:28:18,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,866 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-02-07 17:28:18,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:28:18,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:28:18,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:28:18,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:28:18,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 17:28:18,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:28:18,905 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:28:18,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:28:18,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:28:18,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (1/1) ... [2025-02-07 17:28:18,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:28:18,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:18,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:28:18,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:28:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:28:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:28:18,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:28:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 17:28:19,004 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:28:19,006 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:28:19,126 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 17:28:19,127 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:28:19,133 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:28:19,134 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:28:19,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:28:19 BoogieIcfgContainer [2025-02-07 17:28:19,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:28:19,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:28:19,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:28:19,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:28:19,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:28:18" (1/3) ... [2025-02-07 17:28:19,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60aa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:28:19, skipping insertion in model container [2025-02-07 17:28:19,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:28:18" (2/3) ... [2025-02-07 17:28:19,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60aa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:28:19, skipping insertion in model container [2025-02-07 17:28:19,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:28:19" (3/3) ... [2025-02-07 17:28:19,147 INFO L128 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2025-02-07 17:28:19,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:28:19,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 17:28:19,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:28:19,227 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;@6f93f84e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:28:19,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:28:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 17:28:19,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:19,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 17:28:19,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1226331, now seen corresponding path program 1 times [2025-02-07 17:28:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:19,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336068584] [2025-02-07 17:28:19,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:19,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:19,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:28:19,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 17:28:19,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 17:28:19,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:19,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:19,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:28:19,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:19,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:28:19,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336068584] [2025-02-07 17:28:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336068584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:19,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:28:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832659541] [2025-02-07 17:28:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:19,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:28:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:19,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:28:19,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:28:19,405 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:19,433 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-02-07 17:28:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:28:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:19,443 INFO L225 Difference]: With dead ends: 19 [2025-02-07 17:28:19,443 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:28:19,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:28:19,449 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:19,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:28:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2025-02-07 17:28:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) 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 17:28:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-02-07 17:28:19,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2025-02-07 17:28:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:19,489 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-07 17:28:19,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 17:28:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-02-07 17:28:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:28:19,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:19,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:19,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 17:28:19,695 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 17:28:19,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2002744091, now seen corresponding path program 1 times [2025-02-07 17:28:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081697816] [2025-02-07 17:28:19,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:19,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:19,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:19,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:28:19,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:28:19,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:28:19,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:19,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:19,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:28:19,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:19,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:19,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081697816] [2025-02-07 17:28:19,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081697816] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:19,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:19,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2025-02-07 17:28:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709007969] [2025-02-07 17:28:19,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:28:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:19,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:28:19,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:28:19,832 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:19,874 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-02-07 17:28:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:28:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:28:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:19,875 INFO L225 Difference]: With dead ends: 20 [2025-02-07 17:28:19,876 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 17:28:19,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:28:19,877 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:19,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 17:28:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-07 17:28:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 17:28:19,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2025-02-07 17:28:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:19,881 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 17:28:19,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 17:28:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 17:28:19,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:19,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-02-07 17:28:19,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:28:20,088 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 17:28:20,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:20,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2032459227, now seen corresponding path program 2 times [2025-02-07 17:28:20,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345790645] [2025-02-07 17:28:20,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:28:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:20,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:20,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:28:20,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 17:28:20,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:28:20,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:28:20,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:20,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:28:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:20,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:20,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:20,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345790645] [2025-02-07 17:28:20,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345790645] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:20,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:20,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2025-02-07 17:28:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891689745] [2025-02-07 17:28:20,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:20,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 17:28:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 17:28:20,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-07 17:28:20,450 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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 17:28:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:20,667 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-02-07 17:28:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:28:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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 16 [2025-02-07 17:28:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:20,669 INFO L225 Difference]: With dead ends: 38 [2025-02-07 17:28:20,670 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 17:28:20,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:28:20,671 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:20,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 73 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:28:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 17:28:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-07 17:28:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-02-07 17:28:20,678 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 16 [2025-02-07 17:28:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:20,678 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-02-07 17:28:20,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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 17:28:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-02-07 17:28:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:28:20,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:20,679 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2025-02-07 17:28:20,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:28:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:20,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:20,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 515360091, now seen corresponding path program 3 times [2025-02-07 17:28:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539233834] [2025-02-07 17:28:20,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:28:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:20,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:20,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:28:20,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 9 equivalence classes. [2025-02-07 17:28:20,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:28:20,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 17:28:20,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:20,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-07 17:28:20,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:22,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:41,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539233834] [2025-02-07 17:28:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539233834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:41,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:41,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2025-02-07 17:28:41,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014594630] [2025-02-07 17:28:41,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:41,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-07 17:28:41,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:41,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-07 17:28:41,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=2162, Unknown=2, NotChecked=0, Total=2862 [2025-02-07 17:28:41,400 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 54 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 53 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:54,896 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse39))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse39)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse26)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse26)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse26)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse37)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse30))))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse22)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse38)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse35)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse41)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse42))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse19 (bvslt .cse52 (_ bv8 32))) (.cse21 (bvslt .cse51 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse20)))) (.cse8 (= .cse50 .cse2)) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse12))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse25)))) (.cse14 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse44))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse11)))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))) (_ bv0 32))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))) (_ bv0 32))) (.cse40 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse16 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse18 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse12))) .cse2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse19 (= .cse2 .cse20) .cse15 .cse16 .cse7 .cse18) (or .cse21 .cse16 (= .cse2 .cse22) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse24))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse11)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse24))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse12))) .cse24) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse19 .cse0 .cse15 .cse16 (= .cse32 .cse2) .cse7 .cse18) (or .cse33 (= .cse34 .cse2) .cse5 .cse13 .cse15 .cse16 .cse7 .cse18) (or .cse19 .cse5 (= .cse2 .cse35) .cse15 .cse16 .cse7 .cse18) (or .cse4 (= .cse2 .cse36) .cse7) (or .cse21 .cse5 (= .cse2 .cse37) .cse16 .cse7) (or .cse21 .cse0 (= .cse2 .cse38) .cse16 .cse7) (or (= .cse2 .cse10) .cse33 .cse13 .cse15 .cse16 .cse7 .cse18) (or (bvslt .cse39 (_ bv8 32)) .cse8) (or .cse40 .cse0 .cse16 (= .cse2 .cse41) .cse7 .cse18) (or .cse40 .cse16 (= .cse2 .cse42) .cse7 .cse18) (or .cse33 .cse0 .cse13 (= .cse2 .cse43) .cse15 .cse16 .cse7 .cse18) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse11))))))) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse5 (= .cse29 .cse2) .cse13 .cse15 (bvslt .cse44 (_ bv8 32)) .cse16 .cse17 .cse7 .cse18) (or .cse40 (= .cse45 .cse2) .cse5 .cse16 .cse7 .cse18) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-02-07 17:29:06,261 WARN L286 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 17:29:21,730 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 17:29:30,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse41))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse25)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 .cse30))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse39)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse43)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse44)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19))) .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24))) .cse26)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse42 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse34 (_ bv8 32)) (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse37) .cse7) (or .cse20 .cse5 (= .cse2 .cse38) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse39) .cse15 .cse7) (or .cse0 (= .cse2 .cse40) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse41 (_ bv8 32)) .cse8) (or .cse42 .cse0 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse42 .cse15 (= .cse2 .cse44) .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse40)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse42 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2025-02-07 17:29:40,923 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)