./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i -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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:35:19,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:35:19,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:35:19,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:35:19,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:35:19,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:35:19,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:35:19,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:35:19,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:35:19,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:35:19,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:35:19,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:35:19,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:35:19,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:35:19,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:35:19,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:35:19,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:35:19,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:35:19,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:35:19,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:35:19,451 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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2025-02-06 02:35:19,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:35:19,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:35:19,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:35:19,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:35:19,719 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:35:19,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:20,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbbfbe54e/b1b7dcbb8c494ac98420daa53f75d1e3/FLAG2f6201988 [2025-02-06 02:35:21,114 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:35:21,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:21,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbbfbe54e/b1b7dcbb8c494ac98420daa53f75d1e3/FLAG2f6201988 [2025-02-06 02:35:21,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbbfbe54e/b1b7dcbb8c494ac98420daa53f75d1e3 [2025-02-06 02:35:21,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:35:21,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:35:21,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:35:21,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:35:21,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:35:21,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42803c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21, skipping insertion in model container [2025-02-06 02:35:21,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:35:21,563 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/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-02-06 02:35:21,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:35:21,591 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:35:21,597 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/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-02-06 02:35:21,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:35:21,629 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:35:21,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21 WrapperNode [2025-02-06 02:35:21,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:35:21,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:35:21,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:35:21,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:35:21,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,663 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-02-06 02:35:21,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:35:21,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:35:21,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:35:21,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:35:21,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,681 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-06 02:35:21,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:35:21,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:35:21,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:35:21,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:35:21,689 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (1/1) ... [2025-02-06 02:35:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:35:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:35:21,716 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-06 02:35:21,723 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-06 02:35:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:35:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:35:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:35:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:35:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:35:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:35:21,787 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:35:21,788 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:35:21,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L75: havoc property_#t~bitwise8#1;havoc property_#t~short9#1; [2025-02-06 02:35:21,969 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 02:35:21,970 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:35:21,980 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:35:21,980 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:35:21,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:21 BoogieIcfgContainer [2025-02-06 02:35:21,981 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:35:21,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:35:21,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:35:21,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:35:21,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:35:21" (1/3) ... [2025-02-06 02:35:21,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6bebc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:35:21, skipping insertion in model container [2025-02-06 02:35:21,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:21" (2/3) ... [2025-02-06 02:35:21,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6bebc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:35:21, skipping insertion in model container [2025-02-06 02:35:21,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:21" (3/3) ... [2025-02-06 02:35:21,987 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:21,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:35:21,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-9.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:35:22,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:35:22,057 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;@5369d26a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:35:22,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:35:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 02:35:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 02:35:22,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:22,066 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:22,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:22,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1294960015, now seen corresponding path program 1 times [2025-02-06 02:35:22,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:35:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803699177] [2025-02-06 02:35:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:35:22,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 02:35:22,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 02:35:22,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:22,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 02:35:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:35:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803699177] [2025-02-06 02:35:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803699177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:35:22,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98487841] [2025-02-06 02:35:22,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:22,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:35:22,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:35:22,244 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-06 02:35:22,246 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-06 02:35:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 02:35:22,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 02:35:22,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:22,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:22,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:35:22,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 02:35:22,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98487841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:22,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:35:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:35:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361994590] [2025-02-06 02:35:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:22,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:35:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:35:22,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:35:22,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:35:22,366 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 02:35:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:22,388 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2025-02-06 02:35:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:35:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-02-06 02:35:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:22,394 INFO L225 Difference]: With dead ends: 74 [2025-02-06 02:35:22,394 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 02:35:22,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:35:22,401 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:22,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:35:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 02:35:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 02:35:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 02:35:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-02-06 02:35:22,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 45 [2025-02-06 02:35:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:22,425 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-02-06 02:35:22,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 02:35:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-02-06 02:35:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 02:35:22,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:22,428 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:22,434 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-06 02:35:22,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:35:22,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -842889362, now seen corresponding path program 1 times [2025-02-06 02:35:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:35:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941582278] [2025-02-06 02:35:22,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:35:22,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 02:35:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 02:35:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 02:35:22,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:35:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941582278] [2025-02-06 02:35:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941582278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:35:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677867999] [2025-02-06 02:35:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:35:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:35:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:35:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:35:22,760 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:22,844 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2025-02-06 02:35:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:35:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-02-06 02:35:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:22,847 INFO L225 Difference]: With dead ends: 119 [2025-02-06 02:35:22,847 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 02:35:22,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:35:22,848 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:22,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 135 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:35:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 02:35:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2025-02-06 02:35:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-02-06 02:35:22,858 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 45 [2025-02-06 02:35:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-02-06 02:35:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-02-06 02:35:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 02:35:22,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:22,860 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:22,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:35:22,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1995460737, now seen corresponding path program 1 times [2025-02-06 02:35:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:35:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580177387] [2025-02-06 02:35:22,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:35:22,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 02:35:22,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 02:35:22,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 02:35:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:35:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580177387] [2025-02-06 02:35:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580177387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:35:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439822225] [2025-02-06 02:35:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:23,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:35:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:35:23,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:35:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:35:23,028 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:23,064 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2025-02-06 02:35:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:35:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-02-06 02:35:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:23,067 INFO L225 Difference]: With dead ends: 153 [2025-02-06 02:35:23,068 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 02:35:23,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 02:35:23,068 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:23,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:35:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 02:35:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2025-02-06 02:35:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-02-06 02:35:23,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 46 [2025-02-06 02:35:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:23,079 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-02-06 02:35:23,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-02-06 02:35:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 02:35:23,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:23,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:35:23,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 308108421, now seen corresponding path program 1 times [2025-02-06 02:35:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:35:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348843699] [2025-02-06 02:35:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:35:23,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 02:35:23,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 02:35:23,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 02:35:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:35:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348843699] [2025-02-06 02:35:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348843699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:35:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686095684] [2025-02-06 02:35:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:35:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:35:24,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:35:24,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:35:24,345 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:24,494 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2025-02-06 02:35:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:35:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2025-02-06 02:35:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:24,496 INFO L225 Difference]: With dead ends: 152 [2025-02-06 02:35:24,496 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 02:35:24,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:35:24,497 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:24,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 217 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:35:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 02:35:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2025-02-06 02:35:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-02-06 02:35:24,512 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 47 [2025-02-06 02:35:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:24,512 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-02-06 02:35:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-02-06 02:35:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 02:35:24,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:24,514 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:24,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:35:24,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:24,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 550189584, now seen corresponding path program 1 times [2025-02-06 02:35:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:35:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991283921] [2025-02-06 02:35:24,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:35:24,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:35:24,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:35:24,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:24,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:35:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455533297] [2025-02-06 02:35:24,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:24,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:35:24,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:35:24,565 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-06 02:35:24,567 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-06 02:35:24,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:35:24,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:35:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:24,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:35:24,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:35:24,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 02:35:24,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 02:35:24,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:24,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:35:24,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:35:24,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:35:24,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:35:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:35:24,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:35:24,878 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:35:24,904 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:35:24,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:35:24 BoogieIcfgContainer [2025-02-06 02:35:24,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:35:24,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:35:24,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:35:24,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:35:24,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:21" (3/4) ... [2025-02-06 02:35:24,913 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:35:24,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:35:24,914 INFO L158 Benchmark]: Toolchain (without parser) took 3473.24ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 58.5MB in the end (delta: 64.6MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-02-06 02:35:24,915 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:24,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.77ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:35:24,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:35:24,915 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:24,915 INFO L158 Benchmark]: IcfgBuilder took 292.69ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 90.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:35:24,916 INFO L158 Benchmark]: TraceAbstraction took 2928.12ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 60.1MB in the end (delta: 29.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2025-02-06 02:35:24,916 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 60.1MB in the beginning and 58.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:24,917 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.13ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.77ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 110.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 108.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 292.69ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 90.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2928.12ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 60.1MB in the end (delta: 29.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 167.8MB. Free memory was 60.1MB in the beginning and 58.5MB in the end (delta: 1.6MB). 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 75, overapproximation of shiftLeft at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed short int last_1_var_1_8 = 100; [L31] double last_1_var_1_10 = 9.2; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L71] last_1_var_1_8 = var_1_8 [L72] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L82] RET updateLastVariables() [L83] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L62] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L63] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L63] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L64] var_1_7 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L65] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L66] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L67] var_1_11 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L68] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L83] RET updateVariables() [L84] CALL step() [L35] COND FALSE !(last_1_var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L38] COND FALSE !(((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) [L45] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE (10 << var_1_9) < (var_1_3 * var_1_1) [L51] var_1_8 = (var_1_9 + var_1_1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L53] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L54] COND TRUE ((var_1_1 + var_1_9) < 10) || stepLocal_0 [L55] var_1_12 = ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L84] RET step() [L85] CALL, EXPR property() [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75-L76] return (((((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((var_1_1 + var_1_9) < 10) || (var_1_10 > var_1_10)) ? (var_1_12 == ((signed short int) ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))))) : (var_1_12 == ((signed short int) var_1_8))) ; [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 200 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 192/200 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-06 02:35:24,936 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/hardness-nfm22/hardness_operatoramount_amount25_file-9.i -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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:35:26,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:35:26,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:35:26,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:35:26,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:35:26,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:35:26,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:35:26,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:35:26,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:35:26,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:35:26,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:35:26,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:35:26,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:35:26,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:35:26,913 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:35:26,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:35:26,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:35:26,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:35:26,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:35:26,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:35:26,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:35:26,916 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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2025-02-06 02:35:27,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:35:27,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:35:27,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:35:27,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:35:27,180 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:35:27,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:28,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be1703df/8f9dac7bcc5e45b49f99fbbfbe8d7b9f/FLAG5f1d6b08b [2025-02-06 02:35:28,583 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:35:28,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:28,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be1703df/8f9dac7bcc5e45b49f99fbbfbe8d7b9f/FLAG5f1d6b08b [2025-02-06 02:35:28,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be1703df/8f9dac7bcc5e45b49f99fbbfbe8d7b9f [2025-02-06 02:35:28,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:35:28,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:35:28,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:35:28,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:35:28,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:35:28,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f1fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28, skipping insertion in model container [2025-02-06 02:35:28,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:35:28,740 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/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-02-06 02:35:28,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:35:28,788 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:35:28,796 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/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-02-06 02:35:28,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:35:28,820 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:35:28,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28 WrapperNode [2025-02-06 02:35:28,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:35:28,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:35:28,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:35:28,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:35:28,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,862 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2025-02-06 02:35:28,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:35:28,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:35:28,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:35:28,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:35:28,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,881 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-06 02:35:28,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:35:28,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:35:28,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:35:28,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:35:28,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (1/1) ... [2025-02-06 02:35:28,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:35:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:35:28,926 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-06 02:35:28,933 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-06 02:35:28,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:35:28,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:35:28,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:35:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:35:28,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:35:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:35:29,002 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:35:29,004 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:35:29,171 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:35:29,171 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:35:29,177 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:35:29,178 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:35:29,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:29 BoogieIcfgContainer [2025-02-06 02:35:29,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:35:29,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:35:29,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:35:29,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:35:29,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:35:28" (1/3) ... [2025-02-06 02:35:29,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9dba85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:35:29, skipping insertion in model container [2025-02-06 02:35:29,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:35:28" (2/3) ... [2025-02-06 02:35:29,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9dba85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:35:29, skipping insertion in model container [2025-02-06 02:35:29,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:29" (3/3) ... [2025-02-06 02:35:29,188 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2025-02-06 02:35:29,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:35:29,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-9.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:35:29,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:35:29,247 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;@17e00109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:35:29,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:35:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 02:35:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 02:35:29,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:29,257 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:29,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash -947004480, now seen corresponding path program 1 times [2025-02-06 02:35:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:35:29,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218311289] [2025-02-06 02:35:29,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:29,271 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-06 02:35:29,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:35:29,275 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-06 02:35:29,277 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-06 02:35:29,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 02:35:29,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 02:35:29,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:29,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:29,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:35:29,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 02:35:29,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:29,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:35:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218311289] [2025-02-06 02:35:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218311289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:35:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165676026] [2025-02-06 02:35:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:29,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:35:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:35:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:35:29,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:35:29,420 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 02:35:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:29,437 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-02-06 02:35:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:35:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-02-06 02:35:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:29,443 INFO L225 Difference]: With dead ends: 59 [2025-02-06 02:35:29,444 INFO L226 Difference]: Without dead ends: 29 [2025-02-06 02:35:29,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:35:29,448 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:35:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-06 02:35:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-06 02:35:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 02:35:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-06 02:35:29,475 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 42 [2025-02-06 02:35:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:29,476 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-06 02:35:29,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 02:35:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-06 02:35:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 02:35:29,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:29,477 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:29,483 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-06 02:35:29,678 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-06 02:35:29,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -415089087, now seen corresponding path program 1 times [2025-02-06 02:35:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:35:29,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347576332] [2025-02-06 02:35:29,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:29,680 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-06 02:35:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:35:29,682 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-06 02:35:29,683 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-06 02:35:29,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 02:35:29,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 02:35:29,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:29,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:29,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 02:35:29,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 02:35:29,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:29,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:35:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347576332] [2025-02-06 02:35:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347576332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:29,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:29,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:35:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331320575] [2025-02-06 02:35:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:29,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:35:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:35:29,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:35:29,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:35:29,903 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:29,990 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2025-02-06 02:35:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:35:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2025-02-06 02:35:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:29,991 INFO L225 Difference]: With dead ends: 90 [2025-02-06 02:35:29,991 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 02:35:29,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:35:29,992 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:29,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:35:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 02:35:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-02-06 02:35:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-02-06 02:35:30,001 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 42 [2025-02-06 02:35:30,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:30,001 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-02-06 02:35:30,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-02-06 02:35:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 02:35:30,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:30,002 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:30,006 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 02:35:30,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-06 02:35:30,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:30,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash -324216829, now seen corresponding path program 1 times [2025-02-06 02:35:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:35:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017643185] [2025-02-06 02:35:30,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:30,207 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-06 02:35:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:35:30,208 INFO L229 MonitoredProcess]: Starting monitored process 4 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-06 02:35:30,210 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 (4)] Waiting until timeout for monitored process [2025-02-06 02:35:30,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 02:35:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 02:35:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:30,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 02:35:30,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 02:35:30,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:30,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:35:30,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017643185] [2025-02-06 02:35:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017643185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:30,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:30,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:35:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487593626] [2025-02-06 02:35:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:30,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:35:30,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:35:30,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:35:30,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:35:30,327 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:30,410 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2025-02-06 02:35:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:35:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-02-06 02:35:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:30,411 INFO L225 Difference]: With dead ends: 120 [2025-02-06 02:35:30,411 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 02:35:30,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:35:30,412 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 110 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:35:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 02:35:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2025-02-06 02:35:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2025-02-06 02:35:30,425 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 43 [2025-02-06 02:35:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:30,426 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2025-02-06 02:35:30,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2025-02-06 02:35:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 02:35:30,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:30,426 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:30,430 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 (4)] Ended with exit code 0 [2025-02-06 02:35:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-06 02:35:30,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -323293308, now seen corresponding path program 1 times [2025-02-06 02:35:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:35:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886164112] [2025-02-06 02:35:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:30,628 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-06 02:35:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:35:30,629 INFO L229 MonitoredProcess]: Starting monitored process 5 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-06 02:35:30,631 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 (5)] Waiting until timeout for monitored process [2025-02-06 02:35:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 02:35:30,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 02:35:30,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:30,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:30,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 02:35:30,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 02:35:33,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:33,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:35:33,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886164112] [2025-02-06 02:35:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886164112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:33,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:35:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291078929] [2025-02-06 02:35:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:33,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:35:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:35:33,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:35:33,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:35:33,964 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:34,688 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2025-02-06 02:35:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:35:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-02-06 02:35:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:34,698 INFO L225 Difference]: With dead ends: 77 [2025-02-06 02:35:34,698 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 02:35:34,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:35:34,699 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:34,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:35:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 02:35:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2025-02-06 02:35:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:35:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-02-06 02:35:34,713 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 43 [2025-02-06 02:35:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:34,714 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-02-06 02:35:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-02-06 02:35:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 02:35:34,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:35:34,716 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:35:34,720 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 (5)] Ended with exit code 0 [2025-02-06 02:35:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-06 02:35:34,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:35:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:35:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1210796989, now seen corresponding path program 1 times [2025-02-06 02:35:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:35:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54631734] [2025-02-06 02:35:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:35:34,919 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-06 02:35:34,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:35:34,921 INFO L229 MonitoredProcess]: Starting monitored process 6 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-06 02:35:34,923 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 (6)] Waiting until timeout for monitored process [2025-02-06 02:35:34,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 02:35:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 02:35:34,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:35:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:35:34,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 02:35:34,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:35:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 02:35:38,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:35:38,142 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:35:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54631734] [2025-02-06 02:35:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54631734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:35:38,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:35:38,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:35:38,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763530881] [2025-02-06 02:35:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:35:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:35:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:35:38,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:35:38,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:35:38,145 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:35:38,700 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-02-06 02:35:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:35:38,700 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-02-06 02:35:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:35:38,701 INFO L225 Difference]: With dead ends: 75 [2025-02-06 02:35:38,701 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:35:38,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:35:38,702 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:35:38,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 113 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:35:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:35:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:35:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-06 02:35:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:35:38,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-02-06 02:35:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:35:38,702 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:35:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 02:35:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:35:38,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:35:38,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:35:38,711 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 (6)] Ended with exit code 0 [2025-02-06 02:35:38,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-06 02:35:38,910 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 02:35:38,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:35:39,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:35:39,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-02-06 02:35:39,789 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-02-06 02:35:39,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:35:39 BoogieIcfgContainer [2025-02-06 02:35:39,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:35:39,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:35:39,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:35:39,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:35:39,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:35:29" (3/4) ... [2025-02-06 02:35:39,793 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:35:39,797 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:35:39,799 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 02:35:39,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 02:35:39,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:35:39,800 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:35:39,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:35:39,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:35:39,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:35:39,855 INFO L158 Benchmark]: Toolchain (without parser) took 11243.56ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 92.8MB in the beginning and 333.6MB in the end (delta: -240.8MB). Peak memory consumption was 341.5MB. Max. memory is 16.1GB. [2025-02-06 02:35:39,856 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:39,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.84ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 80.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:35:39,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:35:39,857 INFO L158 Benchmark]: Boogie Preprocessor took 31.80ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:39,857 INFO L158 Benchmark]: IcfgBuilder took 279.81ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:35:39,858 INFO L158 Benchmark]: TraceAbstraction took 10611.05ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 63.3MB in the beginning and 337.6MB in the end (delta: -274.2MB). Peak memory consumption was 316.3MB. Max. memory is 16.1GB. [2025-02-06 02:35:39,858 INFO L158 Benchmark]: Witness Printer took 63.66ms. Allocated memory is still 704.6MB. Free memory was 337.6MB in the beginning and 333.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:35:39,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.84ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 80.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.80ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 279.81ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.8MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10611.05ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 63.3MB in the beginning and 337.6MB in the end (delta: -274.2MB). Peak memory consumption was 316.3MB. Max. memory is 16.1GB. * Witness Printer took 63.66ms. Allocated memory is still 704.6MB. Free memory was 337.6MB in the beginning and 333.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 163 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 21 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Location Invariant Derived location invariant: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64))) RESULT: Ultimate proved your program to be correct! [2025-02-06 02:35:39,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE