./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.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_amount10_file-62.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 edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:11:10,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:11:10,768 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:11:10,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:11:10,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:11:10,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:11:10,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:11:10,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:11:10,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:11:10,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:11:10,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:11:10,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:11:10,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:11:10,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:11:10,803 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:11:10,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:11:10,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:11:10,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:11:10,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:11:10,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:10,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:11:10,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:11:10,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:11:10,806 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2025-02-06 02:11:11,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:11:11,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:11:11,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:11:11,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:11:11,082 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:11:11,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:12,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4190adfec/e557cb1fecaa4901bcd7e84de0a591d1/FLAG716cf5f65 [2025-02-06 02:11:12,623 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:11:12,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:12,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4190adfec/e557cb1fecaa4901bcd7e84de0a591d1/FLAG716cf5f65 [2025-02-06 02:11:12,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4190adfec/e557cb1fecaa4901bcd7e84de0a591d1 [2025-02-06 02:11:12,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:11:12,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:11:12,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:12,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:11:12,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:11:12,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12, skipping insertion in model container [2025-02-06 02:11:12,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,664 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:11:12,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_amount10_file-62.i[915,928] [2025-02-06 02:11:12,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:12,847 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:11:12,857 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_amount10_file-62.i[915,928] [2025-02-06 02:11:12,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:12,893 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:11:12,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12 WrapperNode [2025-02-06 02:11:12,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:12,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:12,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:11:12,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:11:12,900 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:11:12" (1/1) ... [2025-02-06 02:11:12,913 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:11:12" (1/1) ... [2025-02-06 02:11:12,935 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-02-06 02:11:12,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:12,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:11:12,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:11:12,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:11:12,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,961 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:11:12,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:11:12,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:11:12,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:11:12,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:11:12,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (1/1) ... [2025-02-06 02:11:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:13,014 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:11:13,021 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:11:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:11:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:11:13,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:11:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:11:13,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:11:13,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:11:13,099 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:11:13,101 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:11:13,257 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:11:13,258 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:11:13,266 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:11:13,268 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:11:13,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:13 BoogieIcfgContainer [2025-02-06 02:11:13,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:11:13,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:11:13,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:11:13,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:11:13,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:11:12" (1/3) ... [2025-02-06 02:11:13,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:13, skipping insertion in model container [2025-02-06 02:11:13,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:12" (2/3) ... [2025-02-06 02:11:13,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3cec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:13, skipping insertion in model container [2025-02-06 02:11:13,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:13" (3/3) ... [2025-02-06 02:11:13,279 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:13,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:11:13,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-62.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:11:13,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:11:13,345 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;@6004655d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:11:13,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:11:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:13,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:13,361 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:13,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1006487280, now seen corresponding path program 1 times [2025-02-06 02:11:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471391784] [2025-02-06 02:11:13,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:13,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:13,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:13,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:11:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471391784] [2025-02-06 02:11:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471391784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:11:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094927667] [2025-02-06 02:11:13,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:11:13,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:13,559 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:11:13,561 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:11:13,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:11:13,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 02:11:13,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:11:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094927667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:13,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:11:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:11:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919897739] [2025-02-06 02:11:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:13,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:11:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:13,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:11:13,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:13,728 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:11:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:13,745 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2025-02-06 02:11:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:11:13,749 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-02-06 02:11:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:13,754 INFO L225 Difference]: With dead ends: 72 [2025-02-06 02:11:13,755 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 02:11:13,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:11:13,763 INFO L435 NwaCegarLoop]: 48 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, 48 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:11:13,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 02:11:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 02:11:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-06 02:11:13,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2025-02-06 02:11:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:13,790 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-06 02:11:13,790 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:11:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-06 02:11:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:13,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:13,792 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:13,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:11:13,993 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:11:13,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:13,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -651779788, now seen corresponding path program 1 times [2025-02-06 02:11:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-02-06 02:11:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:14,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 02:11:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-02-06 02:11:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120214707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:11:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430485008] [2025-02-06 02:11:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:11:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:14,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:11:14,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:11:14,442 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:14,490 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-02-06 02:11:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:11:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-02-06 02:11:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:14,493 INFO L225 Difference]: With dead ends: 80 [2025-02-06 02:11:14,493 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 02:11:14,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:11:14,495 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:14,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 02:11:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2025-02-06 02:11:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-02-06 02:11:14,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 69 [2025-02-06 02:11:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:14,506 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-02-06 02:11:14,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-02-06 02:11:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:14,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:14,508 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:14,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:11:14,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 235723893, now seen corresponding path program 1 times [2025-02-06 02:11:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307964615] [2025-02-06 02:11:14,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:14,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:14,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 02:11:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307964615] [2025-02-06 02:11:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307964615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:11:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037091963] [2025-02-06 02:11:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:11:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:14,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:11:14,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:11:14,772 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:14,851 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2025-02-06 02:11:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:11:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-02-06 02:11:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:14,853 INFO L225 Difference]: With dead ends: 55 [2025-02-06 02:11:14,853 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 02:11:14,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:11:14,854 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:14,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 234 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 02:11:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2025-02-06 02:11:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-02-06 02:11:14,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 69 [2025-02-06 02:11:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:14,859 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 02:11:14,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-02-06 02:11:14,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 02:11:14,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:14,861 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1] [2025-02-06 02:11:14,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:11:14,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1242018963, now seen corresponding path program 1 times [2025-02-06 02:11:14,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:14,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26616073] [2025-02-06 02:11:14,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:14,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:14,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 02:11:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 02:11:14,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:11:14,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:11:14,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 02:11:14,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 02:11:14,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:11:14,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:11:14,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:11:14,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:11:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:11:14,980 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 02:11:15,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:11:15,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:11:15 BoogieIcfgContainer [2025-02-06 02:11:15,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:11:15,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:11:15,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:11:15,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:11:15,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:13" (3/4) ... [2025-02-06 02:11:15,037 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:11:15,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:11:15,039 INFO L158 Benchmark]: Toolchain (without parser) took 2395.10ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 55.8MB in the end (delta: 68.4MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,040 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:11:15,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.41ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.89ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:11:15,040 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,041 INFO L158 Benchmark]: IcfgBuilder took 290.13ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 96.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,041 INFO L158 Benchmark]: TraceAbstraction took 1761.27ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 55.8MB in the end (delta: 40.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,041 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 167.8MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:15,043 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.18ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.41ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.89ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 110.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 290.13ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 96.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1761.27ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 55.8MB in the end (delta: 40.0MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 167.8MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 31.95; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 255.6; [L25] double var_1_4 = 50.8; [L26] double var_1_5 = 4.4; [L27] double var_1_6 = 100.8; [L28] unsigned char var_1_7 = 50; [L29] signed long int var_1_8 = 256; [L30] unsigned char var_1_9 = 25; VAL [isInitial=0, var_1_1=639/20, var_1_2=0, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L70] isInitial = 1 [L71] FCALL initially() [L72] COND TRUE 1 [L73] FCALL updateLastVariables() [L74] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L49] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L51] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L53] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L55] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L56] var_1_8 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L57] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L58] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L58] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L60] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L74] RET updateVariables() [L75] CALL step() [L34] COND TRUE \read(var_1_2) [L35] var_1_1 = (var_1_3 + ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))) VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L37] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L38] COND TRUE (-10 != var_1_8) || stepLocal_0 VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L39] COND TRUE var_1_1 >= 500.5 [L40] var_1_7 = var_1_9 VAL [isInitial=1, var_1_2=-255, var_1_7=0, var_1_8=0, var_1_9=0] [L75] RET step() [L76] CALL, EXPR property() [L66-L67] return (var_1_2 ? (var_1_1 == ((double) (var_1_3 + ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : 1) && (((-10 != var_1_8) || var_1_2) ? ((var_1_1 >= 500.5) ? (var_1_7 == ((unsigned char) var_1_9)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_2=-255, var_1_7=0, var_1_8=0, var_1_9=0] [L76] RET, EXPR property() [L76] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=-255, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_2=-255, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 267 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 153 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 702/720 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:11:15,062 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 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_amount10_file-62.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 edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:11:17,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:11:17,388 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:11:17,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:11:17,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:11:17,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:11:17,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:11:17,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:11:17,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:11:17,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:11:17,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:11:17,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:11:17,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:11:17,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:11:17,431 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:11:17,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:11:17,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:11:17,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:11:17,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:11:17,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:11:17,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:11:17,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:11:17,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:11:17,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:17,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:11:17,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:11:17,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:11:17,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:11:17,435 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2025-02-06 02:11:17,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:11:17,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:11:17,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:11:17,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:11:17,755 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:11:17,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:19,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee11919d6/87dd2fde2f994d7bba57b2af0149fb64/FLAG518f1c5b9 [2025-02-06 02:11:19,266 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:11:19,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:19,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee11919d6/87dd2fde2f994d7bba57b2af0149fb64/FLAG518f1c5b9 [2025-02-06 02:11:19,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee11919d6/87dd2fde2f994d7bba57b2af0149fb64 [2025-02-06 02:11:19,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:11:19,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:11:19,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:19,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:11:19,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:11:19,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4170ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19, skipping insertion in model container [2025-02-06 02:11:19,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:11:19,449 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_amount10_file-62.i[915,928] [2025-02-06 02:11:19,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:19,507 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:11:19,518 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_amount10_file-62.i[915,928] [2025-02-06 02:11:19,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:19,560 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:11:19,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19 WrapperNode [2025-02-06 02:11:19,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:19,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:19,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:11:19,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:11:19,569 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:11:19" (1/1) ... [2025-02-06 02:11:19,579 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:11:19" (1/1) ... [2025-02-06 02:11:19,604 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-02-06 02:11:19,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:19,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:11:19,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:11:19,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:11:19,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,634 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:11:19,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:11:19,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:11:19,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:11:19,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:11:19,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (1/1) ... [2025-02-06 02:11:19,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:19,696 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:11:19,700 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:11:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:11:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:11:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:11:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:11:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:11:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:11:19,800 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:11:19,802 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:11:20,345 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:11:20,346 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:11:20,353 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:11:20,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:11:20,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:20 BoogieIcfgContainer [2025-02-06 02:11:20,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:11:20,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:11:20,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:11:20,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:11:20,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:11:19" (1/3) ... [2025-02-06 02:11:20,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b8e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:20, skipping insertion in model container [2025-02-06 02:11:20,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:19" (2/3) ... [2025-02-06 02:11:20,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564b8e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:20, skipping insertion in model container [2025-02-06 02:11:20,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:20" (3/3) ... [2025-02-06 02:11:20,366 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2025-02-06 02:11:20,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:11:20,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-62.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:11:20,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:11:20,434 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;@a079006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:11:20,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:11:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:20,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:20,444 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:20,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1006487280, now seen corresponding path program 1 times [2025-02-06 02:11:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939379473] [2025-02-06 02:11:20,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:20,456 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:11:20,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:11:20,460 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:11:20,461 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:11:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:20,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:20,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:20,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:20,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:11:20,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 02:11:20,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:11:20,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:11:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939379473] [2025-02-06 02:11:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939379473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:11:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302834928] [2025-02-06 02:11:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:20,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:11:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:11:20,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:11:20,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:20,703 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:11:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:20,725 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2025-02-06 02:11:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:11:20,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-02-06 02:11:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:20,734 INFO L225 Difference]: With dead ends: 72 [2025-02-06 02:11:20,734 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 02:11:20,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:11:20,741 INFO L435 NwaCegarLoop]: 48 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, 48 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:11:20,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 02:11:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 02:11:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-02-06 02:11:20,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2025-02-06 02:11:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-02-06 02:11:20,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 02:11:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-02-06 02:11:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:20,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:20,779 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:20,785 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:11:20,980 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:11:20,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -651779788, now seen corresponding path program 1 times [2025-02-06 02:11:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983373898] [2025-02-06 02:11:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:20,982 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:11:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:11:20,984 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:11:20,985 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:11:21,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:21,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:21,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:21,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:11:21,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-06 02:11:21,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:11:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 02:11:21,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:11:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983373898] [2025-02-06 02:11:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983373898] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 02:11:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:11:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 02:11:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597266052] [2025-02-06 02:11:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:11:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:11:21,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:11:21,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:11:21,563 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:21,801 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-02-06 02:11:21,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:11:21,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2025-02-06 02:11:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:21,802 INFO L225 Difference]: With dead ends: 80 [2025-02-06 02:11:21,802 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 02:11:21,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:11:21,803 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:21,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 143 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:11:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 02:11:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2025-02-06 02:11:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 02:11:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-02-06 02:11:21,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 69 [2025-02-06 02:11:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:21,813 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-02-06 02:11:21,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 02:11:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2025-02-06 02:11:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 02:11:21,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:21,814 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1] [2025-02-06 02:11:21,822 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 (3)] Ended with exit code 0 [2025-02-06 02:11:22,015 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:11:22,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 235723893, now seen corresponding path program 1 times [2025-02-06 02:11:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420465159] [2025-02-06 02:11:22,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:22,016 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:11:22,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:11:22,020 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:11:22,021 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:11:22,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 02:11:22,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 02:11:22,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:22,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:11:22,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:12:16,645 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)