./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/Muller_Kahan.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/float-benchs/Muller_Kahan.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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:26:13,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:26:13,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 18:26:13,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:26:13,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:26:13,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:26:13,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:26:13,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:26:13,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:26:13,694 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:26:13,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:26:13,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:26:13,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:26:13,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:26:13,695 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:26:13,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:26:13,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:26:13,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:26:13,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:26:13,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:26:13,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 18:26:13,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 18:26:13,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:26:13,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:26:13,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:26:13,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:26:13,699 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2025-02-07 18:26:13,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:26:13,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:26:13,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:26:13,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:26:13,953 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:26:13,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-02-07 18:26:15,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0eca956/a5984619bd0d469299caedb5999cf0c4/FLAGd69dce63d [2025-02-07 18:26:15,502 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:26:15,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-02-07 18:26:15,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0eca956/a5984619bd0d469299caedb5999cf0c4/FLAGd69dce63d [2025-02-07 18:26:15,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf0eca956/a5984619bd0d469299caedb5999cf0c4 [2025-02-07 18:26:15,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:26:15,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:26:15,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:26:15,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:26:15,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:26:15,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630de551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15, skipping insertion in model container [2025-02-07 18:26:15,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:26:15,669 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/float-benchs/Muller_Kahan.c[631,644] [2025-02-07 18:26:15,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:26:15,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:26:15,700 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/float-benchs/Muller_Kahan.c[631,644] [2025-02-07 18:26:15,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:26:15,714 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:26:15,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15 WrapperNode [2025-02-07 18:26:15,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:26:15,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:26:15,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:26:15,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:26:15,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,743 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-02-07 18:26:15,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:26:15,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:26:15,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:26:15,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:26:15,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,762 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 18:26:15,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:26:15,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:26:15,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:26:15,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:26:15,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (1/1) ... [2025-02-07 18:26:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:26:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:15,813 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 18:26:15,817 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 18:26:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:26:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:26:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:26:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 18:26:15,881 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:26:15,883 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:26:15,998 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 18:26:15,998 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:26:16,010 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:26:16,011 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:26:16,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:26:16 BoogieIcfgContainer [2025-02-07 18:26:16,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:26:16,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:26:16,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:26:16,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:26:16,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:26:15" (1/3) ... [2025-02-07 18:26:16,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b50e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:26:16, skipping insertion in model container [2025-02-07 18:26:16,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:15" (2/3) ... [2025-02-07 18:26:16,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b50e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:26:16, skipping insertion in model container [2025-02-07 18:26:16,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:26:16" (3/3) ... [2025-02-07 18:26:16,022 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2025-02-07 18:26:16,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:26:16,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:26:16,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:26:16,104 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;@2294f3a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:26:16,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:26:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 18:26:16,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:16,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 18:26:16,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1136958, now seen corresponding path program 1 times [2025-02-07 18:26:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6447692] [2025-02-07 18:26:16,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:26:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:16,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 18:26:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 18:26:16,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:16,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:16,273 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 18:26:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6447692] [2025-02-07 18:26:16,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6447692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:26:16,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:26:16,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:26:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194904127] [2025-02-07 18:26:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:26:16,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 18:26:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:16,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 18:26:16,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:26:16,301 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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 18:26:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:16,325 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-07 18:26:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 18:26:16,328 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 18:26:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:16,332 INFO L225 Difference]: With dead ends: 15 [2025-02-07 18:26:16,332 INFO L226 Difference]: Without dead ends: 6 [2025-02-07 18:26:16,334 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 18:26:16,336 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:16,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:26:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-02-07 18:26:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-07 18:26:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 18:26:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-02-07 18:26:16,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-02-07 18:26:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-02-07 18:26:16,359 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 18:26:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-02-07 18:26:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 18:26:16,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:16,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 18:26:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 18:26:16,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash 35277444, now seen corresponding path program 1 times [2025-02-07 18:26:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 18:26:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:26:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:16,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 18:26:16,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 18:26:16,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:16,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:16,411 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 18:26:16,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 18:26:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486921650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507949788] [2025-02-07 18:26:16,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:26:16,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:16,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:16,414 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 18:26:16,419 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 18:26:16,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 18:26:16,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 18:26:16,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:16,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:16,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 18:26:16,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:16,496 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 18:26:16,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:16,522 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 18:26:16,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507949788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:16,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-07 18:26:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490278149] [2025-02-07 18:26:16,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:26:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:16,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:26:16,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:26:16,525 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:16,537 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2025-02-07 18:26:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 18:26:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-07 18:26:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:16,538 INFO L225 Difference]: With dead ends: 12 [2025-02-07 18:26:16,538 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 18:26:16,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:26:16,539 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:16,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:26:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 18:26:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-07 18:26:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 18:26:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-07 18:26:16,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-07 18:26:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:16,544 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-07 18:26:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-07 18:26:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 18:26:16,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:16,545 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2025-02-07 18:26:16,551 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 18:26:16,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:16,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1285129538, now seen corresponding path program 2 times [2025-02-07 18:26:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956139967] [2025-02-07 18:26:16,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 18:26:16,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:16,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-07 18:26:16,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 18:26:16,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 18:26:16,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:16,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956139967] [2025-02-07 18:26:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956139967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12537079] [2025-02-07 18:26:16,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 18:26:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:16,877 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 18:26:16,879 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 18:26:16,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-07 18:26:16,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 18:26:16,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 18:26:16,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:16,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:26:16,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:16,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12537079] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:17,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-07 18:26:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490001648] [2025-02-07 18:26:17,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:17,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 18:26:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:17,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 18:26:17,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-07 18:26:17,040 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:17,058 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-07 18:26:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 18:26:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 18:26:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:17,059 INFO L225 Difference]: With dead ends: 18 [2025-02-07 18:26:17,059 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 18:26:17,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-07 18:26:17,060 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:17,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:26:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 18:26:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-07 18:26:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 18:26:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-02-07 18:26:17,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-02-07 18:26:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-02-07 18:26:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-02-07 18:26:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 18:26:17,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:17,066 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2025-02-07 18:26:17,073 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 18:26:17,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:17,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1273477890, now seen corresponding path program 3 times [2025-02-07 18:26:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448019448] [2025-02-07 18:26:17,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 18:26:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:17,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-02-07 18:26:17,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 18:26:17,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 18:26:17,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448019448] [2025-02-07 18:26:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448019448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174808434] [2025-02-07 18:26:17,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 18:26:17,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:17,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:17,533 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 18:26:17,535 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 18:26:17,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 6 equivalence classes. [2025-02-07 18:26:17,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 18:26:17,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 18:26:17,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:17,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 18:26:17,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:17,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:17,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174808434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:17,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-07 18:26:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991828523] [2025-02-07 18:26:17,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 18:26:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:17,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 18:26:17,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-07 18:26:17,891 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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 18:26:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:17,931 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-02-07 18:26:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 18:26:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 18:26:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:17,932 INFO L225 Difference]: With dead ends: 30 [2025-02-07 18:26:17,932 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 18:26:17,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-07 18:26:17,933 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:17,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:26:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 18:26:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 18:26:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-02-07 18:26:17,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2025-02-07 18:26:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:17,941 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-02-07 18:26:17,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 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 18:26:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-02-07 18:26:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 18:26:17,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:17,942 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2025-02-07 18:26:17,948 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 18:26:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:18,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash 325962110, now seen corresponding path program 4 times [2025-02-07 18:26:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20539259] [2025-02-07 18:26:18,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 18:26:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:18,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-07 18:26:18,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 18:26:18,169 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 18:26:18,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20539259] [2025-02-07 18:26:18,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20539259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278978859] [2025-02-07 18:26:18,677 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 18:26:18,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:18,681 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 18:26:18,682 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 18:26:18,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-07 18:26:18,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 18:26:18,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 18:26:18,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:18,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 18:26:18,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:18,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278978859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:19,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-07 18:26:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070025891] [2025-02-07 18:26:19,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-07 18:26:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-07 18:26:19,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 18:26:19,644 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 48 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 47 states have internal predecessors, (50), 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 18:26:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:19,698 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2025-02-07 18:26:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-07 18:26:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 47 states have internal predecessors, (50), 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 26 [2025-02-07 18:26:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:19,699 INFO L225 Difference]: With dead ends: 54 [2025-02-07 18:26:19,699 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 18:26:19,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 18:26:19,701 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:26:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 18:26:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-07 18:26:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 18:26:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2025-02-07 18:26:19,708 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2025-02-07 18:26:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:19,708 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2025-02-07 18:26:19,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 47 states have internal predecessors, (50), 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 18:26:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2025-02-07 18:26:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 18:26:19,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:19,712 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2025-02-07 18:26:19,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 18:26:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:19,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:19,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash -598699394, now seen corresponding path program 5 times [2025-02-07 18:26:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229943402] [2025-02-07 18:26:19,913 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 18:26:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:19,934 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 24 equivalence classes. [2025-02-07 18:26:19,963 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 18:26:19,963 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-02-07 18:26:19,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229943402] [2025-02-07 18:26:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229943402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111104481] [2025-02-07 18:26:21,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 18:26:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:21,411 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 18:26:21,413 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 18:26:21,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 24 equivalence classes. [2025-02-07 18:26:21,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 18:26:21,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-02-07 18:26:21,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:21,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-07 18:26:21,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:21,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111104481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:23,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:23,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-07 18:26:23,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275696167] [2025-02-07 18:26:23,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-07 18:26:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:23,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-07 18:26:23,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-07 18:26:23,992 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 96 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 95 states have internal predecessors, (98), 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 18:26:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:24,118 INFO L93 Difference]: Finished difference Result 102 states and 149 transitions. [2025-02-07 18:26:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-07 18:26:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 95 states have internal predecessors, (98), 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 50 [2025-02-07 18:26:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:24,121 INFO L225 Difference]: With dead ends: 102 [2025-02-07 18:26:24,121 INFO L226 Difference]: Without dead ends: 99 [2025-02-07 18:26:24,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-07 18:26:24,125 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:24,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:26:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-07 18:26:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-07 18:26:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 18:26:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2025-02-07 18:26:24,141 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 50 [2025-02-07 18:26:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2025-02-07 18:26:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 95 states have internal predecessors, (98), 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 18:26:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2025-02-07 18:26:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-07 18:26:24,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:24,145 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1] [2025-02-07 18:26:24,153 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 18:26:24,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:24,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1383408766, now seen corresponding path program 6 times [2025-02-07 18:26:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294098174] [2025-02-07 18:26:24,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 18:26:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:24,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 98 statements into 48 equivalence classes. [2025-02-07 18:26:24,457 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 18:26:24,457 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-02-07 18:26:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:28,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 18:26:28,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294098174] [2025-02-07 18:26:28,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294098174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 18:26:28,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341481652] [2025-02-07 18:26:28,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 18:26:28,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 18:26:28,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:28,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 18:26:28,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 18:26:28,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 98 statements into 48 equivalence classes. [2025-02-07 18:26:28,902 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 98 of 98 statements. [2025-02-07 18:26:28,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-02-07 18:26:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-07 18:26:28,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:29,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:26:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341481652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:32,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 18:26:32,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 101 [2025-02-07 18:26:32,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578309166] [2025-02-07 18:26:32,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:32,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-02-07 18:26:32,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 18:26:32,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-02-07 18:26:32,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-02-07 18:26:32,399 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 102 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 101 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 18:26:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:32,512 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-02-07 18:26:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-07 18:26:32,512 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 101 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 98 [2025-02-07 18:26:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:32,513 INFO L225 Difference]: With dead ends: 108 [2025-02-07 18:26:32,513 INFO L226 Difference]: Without dead ends: 105 [2025-02-07 18:26:32,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 100 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2025-02-07 18:26:32,516 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:32,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:26:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-07 18:26:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-07 18:26:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 104 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 18:26:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2025-02-07 18:26:32,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 98 [2025-02-07 18:26:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:32,529 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2025-02-07 18:26:32,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 101 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 18:26:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2025-02-07 18:26:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-07 18:26:32,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:32,530 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2025-02-07 18:26:32,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 18:26:32,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-07 18:26:32,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:32,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash -93282626, now seen corresponding path program 7 times [2025-02-07 18:26:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 18:26:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778970245] [2025-02-07 18:26:32,732 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 18:26:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 18:26:32,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-07 18:26:32,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-07 18:26:32,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:32,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:26:32,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 18:26:32,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-07 18:26:32,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-07 18:26:32,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:32,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:26:32,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 18:26:32,883 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 18:26:32,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 18:26:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 18:26:32,890 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1] [2025-02-07 18:26:32,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 18:26:32,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 06:26:32 BoogieIcfgContainer [2025-02-07 18:26:32,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 18:26:32,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 18:26:32,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 18:26:32,955 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 18:26:32,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:26:16" (3/4) ... [2025-02-07 18:26:32,957 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 18:26:32,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 18:26:32,958 INFO L158 Benchmark]: Toolchain (without parser) took 17423.19ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 133.8MB in the beginning and 193.5MB in the end (delta: -59.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-02-07 18:26:32,959 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:26:32,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 123.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 18:26:32,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.56ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:26:32,959 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 121.0MB in the end (delta: 864.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:26:32,959 INFO L158 Benchmark]: IcfgBuilder took 235.21ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 110.9MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 18:26:32,960 INFO L158 Benchmark]: TraceAbstraction took 16939.37ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 110.1MB in the beginning and 193.6MB in the end (delta: -83.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-02-07 18:26:32,960 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 260.0MB. Free memory was 193.6MB in the beginning and 193.5MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:26:32,961 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 167.8MB. Free memory was 133.8MB in the beginning and 123.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.56ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 121.0MB in the end (delta: 864.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 235.21ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 110.9MB in the end (delta: 10.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16939.37ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 110.1MB in the beginning and 193.6MB in the end (delta: -83.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 260.0MB. Free memory was 193.6MB in the beginning and 193.5MB in the end (delta: 78.5kB). 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: 12]: 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 someBinaryArithmeticDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19, overapproximation of someBinaryDOUBLEComparisonOperation at line 27. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=1, x1=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=2, x1=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=3, x1=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=4, x1=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=5, x1=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=6, x1=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=7, x1=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=8, x1=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=9, x1=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=10, x1=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=11, x1=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=12, x1=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=13, x1=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=14, x1=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=15, x1=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=16, x1=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=17, x1=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=18, x1=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=19, x1=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=20, x1=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=21, x1=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=22, x1=174] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=23, x1=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=24, x1=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=25, x1=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=26, x1=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=27, x1=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=28, x1=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=29, x1=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=30, x1=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=31, x1=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=32, x1=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=33, x1=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=34, x1=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=35, x1=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=36, x1=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=37, x1=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=38, x1=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=39, x1=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=40, x1=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=41, x1=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=42, x1=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=43, x1=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=44, x1=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=45, x1=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=46, x1=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=47, x1=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=48, x1=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=49, x1=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=50, x1=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=51, x1=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=52, x1=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=53, x1=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=54, x1=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=55, x1=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=56, x1=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=57, x1=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=58, x1=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=59, x1=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=60, x1=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=61, x1=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=62, x1=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=63, x1=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=64, x1=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=65, x1=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=66, x1=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=67, x1=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=68, x1=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=69, x1=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=70, x1=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=71, x1=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=72, x1=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=73, x1=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=74, x1=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=75, x1=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=76, x1=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=77, x1=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=78, x1=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=79, x1=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=80, x1=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=81, x1=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=82, x1=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=83, x1=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=84, x1=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=85, x1=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=86, x1=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=87, x1=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=88, x1=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=89, x1=167] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=90, x1=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=91, x1=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=92, x1=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=93, x1=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=94, x1=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=95, x1=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=96, x1=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=97, x1=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=98, x1=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=99, x1=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=100, x1=144] [L21] COND FALSE !(i < 100) [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 31 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 214 SyntacticMatches, 90 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=7, InterpolantAutomatonStates: 291, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 1688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/17595 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 18:26:32,988 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/float-benchs/Muller_Kahan.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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:26:35,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:26:35,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 18:26:35,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:26:35,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:26:35,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:26:35,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:26:35,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:26:35,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:26:35,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:26:35,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:26:35,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:26:35,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:26:35,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:26:35,364 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:26:35,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:26:35,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:26:35,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:26:35,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:26:35,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:26:35,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:26:35,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:26:35,367 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2025-02-07 18:26:35,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:26:35,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:26:35,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:26:35,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:26:35,681 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:26:35,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-02-07 18:26:37,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab6d2a1f/2f9d4058e8334525b256ee5632f3b153/FLAG1c31a267d [2025-02-07 18:26:37,280 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:26:37,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-02-07 18:26:37,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab6d2a1f/2f9d4058e8334525b256ee5632f3b153/FLAG1c31a267d [2025-02-07 18:26:37,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab6d2a1f/2f9d4058e8334525b256ee5632f3b153 [2025-02-07 18:26:37,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:26:37,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:26:37,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:26:37,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:26:37,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:26:37,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22994836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37, skipping insertion in model container [2025-02-07 18:26:37,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:26:37,467 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/float-benchs/Muller_Kahan.c[631,644] [2025-02-07 18:26:37,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:26:37,497 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:26:37,507 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/float-benchs/Muller_Kahan.c[631,644] [2025-02-07 18:26:37,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:26:37,526 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:26:37,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37 WrapperNode [2025-02-07 18:26:37,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:26:37,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:26:37,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:26:37,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:26:37,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,558 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2025-02-07 18:26:37,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:26:37,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:26:37,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:26:37,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:26:37,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,580 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 18:26:37,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:26:37,596 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:26:37,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:26:37,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:26:37,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (1/1) ... [2025-02-07 18:26:37,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:26:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:26:37,631 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 18:26:37,634 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 18:26:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:26:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:26:37,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:26:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 18:26:37,704 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:26:37,705 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:26:42,114 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 18:26:42,114 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:26:42,121 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:26:42,121 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:26:42,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:26:42 BoogieIcfgContainer [2025-02-07 18:26:42,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:26:42,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:26:42,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:26:42,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:26:42,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:26:37" (1/3) ... [2025-02-07 18:26:42,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adef6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:26:42, skipping insertion in model container [2025-02-07 18:26:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:26:37" (2/3) ... [2025-02-07 18:26:42,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adef6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:26:42, skipping insertion in model container [2025-02-07 18:26:42,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:26:42" (3/3) ... [2025-02-07 18:26:42,129 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2025-02-07 18:26:42,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:26:42,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:26:42,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:26:42,190 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;@2d18fb48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:26:42,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:26:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:26:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 18:26:42,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:42,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 18:26:42,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:42,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1136958, now seen corresponding path program 1 times [2025-02-07 18:26:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:26:42,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926822777] [2025-02-07 18:26:42,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:26:42,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:26:42,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:26:42,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:26:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-07 18:26:42,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 18:26:42,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 18:26:42,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:42,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:42,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 18:26:42,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:42,426 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 18:26:42,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:26:42,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:26:42,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926822777] [2025-02-07 18:26:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926822777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:26:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:26:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:26:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954663507] [2025-02-07 18:26:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:26:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 18:26:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:26:42,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 18:26:42,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:26:42,455 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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 18:26:46,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:50,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:55,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:26:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:26:55,889 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-07 18:26:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 18:26:55,892 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 18:26:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:26:55,897 INFO L225 Difference]: With dead ends: 15 [2025-02-07 18:26:55,897 INFO L226 Difference]: Without dead ends: 6 [2025-02-07 18:26:55,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:26:55,903 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-02-07 18:26:55,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2025-02-07 18:26:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2025-02-07 18:26:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2025-02-07 18:26:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 18:26:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2025-02-07 18:26:55,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2025-02-07 18:26:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:26:55,950 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2025-02-07 18:26:55,950 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 18:26:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2025-02-07 18:26:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 18:26:55,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:26:55,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 18:26:55,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-07 18:26:56,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:26:56,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:26:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:26:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 35277444, now seen corresponding path program 1 times [2025-02-07 18:26:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:26:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148063749] [2025-02-07 18:26:56,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:26:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 18:26:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:26:56,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 18:26:56,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-07 18:26:56,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 18:26:57,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 18:26:57,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:26:57,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:26:57,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 18:26:57,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:26:57,702 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 18:26:57,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 18:26:58,120 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 18:26:58,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:26:58,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148063749] [2025-02-07 18:26:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148063749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 18:26:58,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 18:26:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-07 18:26:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917691235] [2025-02-07 18:26:58,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 18:26:58,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:26:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:26:58,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:26:58,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:26:58,122 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 18:27:02,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:06,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:10,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:14,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:18,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:23,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:27,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:31,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:35,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:39,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:43,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:47,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-07 18:27:51,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []