./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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_loopvsstraightlinecode_25-1loop_file-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:11:37,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:11:37,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:11:37,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:11:37,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:11:37,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:11:37,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:11:37,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:11:37,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:11:37,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:11:37,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:11:37,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:11:37,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:11:37,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:11:37,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:11:37,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:11:37,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:11:37,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:11:37,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:11:37,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:11:37,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:11:37,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:11:37,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:11:37,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:11:37,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:37,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:11:37,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:11:37,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:11:37,627 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f [2025-02-06 01:11:37,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:11:37,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:11:37,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:11:37,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:11:37,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:11:37,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:11:39,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c9d2623a/f590b2d72d884e9cbc5cb5968a256b53/FLAGc99b8ad1a [2025-02-06 01:11:39,463 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:11:39,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:11:39,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c9d2623a/f590b2d72d884e9cbc5cb5968a256b53/FLAGc99b8ad1a [2025-02-06 01:11:39,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c9d2623a/f590b2d72d884e9cbc5cb5968a256b53 [2025-02-06 01:11:39,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:11:39,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:11:39,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:39,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:11:39,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:11:39,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:39" (1/1) ... [2025-02-06 01:11:39,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abdf108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:39, skipping insertion in model container [2025-02-06 01:11:39,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:11:39" (1/1) ... [2025-02-06 01:11:39,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:11:39,927 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_loopvsstraightlinecode_25-1loop_file-45.i[915,928] [2025-02-06 01:11:39,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:39,993 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:11:40,005 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_loopvsstraightlinecode_25-1loop_file-45.i[915,928] [2025-02-06 01:11:40,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:11:40,050 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:11:40,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40 WrapperNode [2025-02-06 01:11:40,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:11:40,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:40,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:11:40,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:11:40,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,098 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-02-06 01:11:40,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:11:40,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:11:40,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:11:40,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:11:40,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,125 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 01:11:40,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:11:40,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:11:40,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:11:40,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:11:40,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (1/1) ... [2025-02-06 01:11:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:11:40,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:40,185 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 01:11:40,188 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 01:11:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:11:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:11:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:11:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:11:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:11:40,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:11:40,262 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:11:40,263 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:11:40,472 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:11:40,472 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:11:40,483 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:11:40,484 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:11:40,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:40 BoogieIcfgContainer [2025-02-06 01:11:40,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:11:40,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:11:40,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:11:40,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:11:40,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:11:39" (1/3) ... [2025-02-06 01:11:40,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328d66c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:40, skipping insertion in model container [2025-02-06 01:11:40,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:11:40" (2/3) ... [2025-02-06 01:11:40,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328d66c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:40, skipping insertion in model container [2025-02-06 01:11:40,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:40" (3/3) ... [2025-02-06 01:11:40,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:11:40,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:11:40,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:11:40,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:11:40,573 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;@699c9754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:11:40,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:11:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:11:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:11:40,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:40,590 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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 01:11:40,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:40,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1462616748, now seen corresponding path program 1 times [2025-02-06 01:11:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:11:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663833524] [2025-02-06 01:11:40,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:11:40,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:11:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:11:40,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:40,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 01:11:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:11:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663833524] [2025-02-06 01:11:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663833524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:11:40,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796415989] [2025-02-06 01:11:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:40,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:11:40,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:40,921 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 01:11:40,922 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 01:11:41,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:11:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:11:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:41,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:11:41,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 01:11:41,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:11:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796415989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:11:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:11:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404008863] [2025-02-06 01:11:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:11:41,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:11:41,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:11:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:11:41,134 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:11:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:41,168 INFO L93 Difference]: Finished difference Result 103 states and 170 transitions. [2025-02-06 01:11:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:11:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2025-02-06 01:11:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:41,174 INFO L225 Difference]: With dead ends: 103 [2025-02-06 01:11:41,174 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 01:11:41,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 01:11:41,178 INFO L435 NwaCegarLoop]: 75 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, 75 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 01:11:41,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:11:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 01:11:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 01:11:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:11:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 01:11:41,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-02-06 01:11:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:41,215 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 01:11:41,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 01:11:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 01:11:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:11:41,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:41,219 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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 01:11:41,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:11:41,419 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 01:11:41,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1140455945, now seen corresponding path program 1 times [2025-02-06 01:11:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:11:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007460094] [2025-02-06 01:11:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:11:41,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:11:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:11:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 60 proven. 120 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-02-06 01:11:49,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:11:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007460094] [2025-02-06 01:11:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007460094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:11:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871616972] [2025-02-06 01:11:49,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:49,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:11:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:11:49,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:11:49,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:11:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:11:49,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:11:49,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:49,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:49,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 01:11:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 339 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-02-06 01:11:51,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:11:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 99 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-02-06 01:11:53,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871616972] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:11:53,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:11:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 30 [2025-02-06 01:11:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127973282] [2025-02-06 01:11:53,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:11:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 01:11:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:11:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 01:11:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2025-02-06 01:11:53,063 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-02-06 01:11:56,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 01:12:00,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 01:12:03,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 01:12:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:12:21,301 INFO L93 Difference]: Finished difference Result 231 states and 301 transitions. [2025-02-06 01:12:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 01:12:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 119 [2025-02-06 01:12:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:12:21,304 INFO L225 Difference]: With dead ends: 231 [2025-02-06 01:12:21,305 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 01:12:21,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=1131, Invalid=3025, Unknown=4, NotChecked=0, Total=4160 [2025-02-06 01:12:21,308 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 182 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:12:21,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 446 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 835 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2025-02-06 01:12:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 01:12:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 149. [2025-02-06 01:12:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.127659574468085) internal successors, (106), 95 states have internal predecessors, (106), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 01:12:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2025-02-06 01:12:21,351 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 119 [2025-02-06 01:12:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:12:21,352 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2025-02-06 01:12:21,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 26 states have internal predecessors, (72), 10 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2025-02-06 01:12:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2025-02-06 01:12:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:12:21,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:12:21,357 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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 01:12:21,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:12:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:12:21,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:12:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:12:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1141379466, now seen corresponding path program 1 times [2025-02-06 01:12:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:12:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515552498] [2025-02-06 01:12:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:12:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:12:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:12:21,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:12:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:12:21,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:12:21,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:12:21,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:12:21,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:12:21,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:12:21,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:12:21,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:12:21,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:12:21,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:12:21,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:12:21,805 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:12:21,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:12:21,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:12:21 BoogieIcfgContainer [2025-02-06 01:12:21,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:12:21,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:12:21,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:12:21,896 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:12:21,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:40" (3/4) ... [2025-02-06 01:12:21,898 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:12:21,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:12:21,900 INFO L158 Benchmark]: Toolchain (without parser) took 42126.05ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 110.0MB in the beginning and 423.7MB in the end (delta: -313.7MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2025-02-06 01:12:21,900 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 127.9MB in the beginning and 127.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:12:21,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.28ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 96.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:12:21,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:12:21,902 INFO L158 Benchmark]: Boogie Preprocessor took 49.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:12:21,902 INFO L158 Benchmark]: IcfgBuilder took 334.71ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 76.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:12:21,903 INFO L158 Benchmark]: TraceAbstraction took 41408.16ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 75.6MB in the beginning and 423.9MB in the end (delta: -348.2MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-02-06 01:12:21,903 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 553.6MB. Free memory was 423.9MB in the beginning and 423.7MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:12:21,905 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.19ms. Allocated memory is still 201.3MB. Free memory was 127.9MB in the beginning and 127.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.28ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 96.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.72ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 334.71ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 76.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41408.16ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 75.6MB in the beginning and 423.9MB in the end (delta: -348.2MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 553.6MB. Free memory was 423.9MB in the beginning and 423.7MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 5.9; [L25] double var_1_8 = 255.6; [L26] unsigned long int var_1_9 = 4; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 1142722175; [L29] unsigned long int var_1_12 = 1231257437; [L30] signed char var_1_13 = -10; [L31] signed char var_1_14 = 100; [L32] signed char var_1_15 = 4; [L33] signed char var_1_16 = 64; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = -8; [L36] unsigned char var_1_19 = 4; VAL [isInitial=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L100] COND TRUE k_loop < 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L59] var_1_6 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L60] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L61] var_1_7 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L62] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L63] var_1_8 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L64] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L65] var_1_10 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L66] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L68] var_1_11 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L69] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L71] var_1_12 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L72] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L74] var_1_14 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L75] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L77] var_1_15 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L78] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L80] var_1_16 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L81] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L84] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L86] var_1_18 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE \read(var_1_10) [L41] var_1_9 = ((var_1_11 + var_1_12) - 5u) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=4, var_1_1=4999996/5, var_1_9=-128] [L43] var_1_19 = var_1_16 [L44] unsigned long int stepLocal_0 = ((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)); VAL [isInitial=1, stepLocal_0=-128, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-10, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=4999996/5, var_1_9=-128] [L45] COND TRUE \read(var_1_10) [L46] var_1_13 = (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))) VAL [isInitial=1, stepLocal_0=-128, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-51, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=4999996/5, var_1_9=-128] [L52] COND FALSE !((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) [L55] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=-128, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-51, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-128] [L103] RET step() [L104] CALL, EXPR property() [L93-L94] return (((((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) var_1_6))) && (var_1_10 ? (var_1_9 == ((unsigned long int) ((var_1_11 + var_1_12) - 5u))) : 1)) && (var_1_10 ? (var_1_13 == ((signed char) (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))))) : ((var_1_12 < (((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)))) ? (var_1_13 == ((signed char) (var_1_17 + var_1_18))) : 1))) && (var_1_19 == ((unsigned char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-51, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-128] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-51, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=2147483647, var_1_12=-2147483770, var_1_13=-51, var_1_14=-1, var_1_15=50, var_1_16=126, var_1_17=63, var_1_18=63, var_1_19=126, var_1_1=2147483652, var_1_6=2147483652, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 157 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 21.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=2, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 35 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 590 ConstructedInterpolants, 3 QuantifiedInterpolants, 3786 SizeOfPredicates, 8 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3045/3420 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 01:12:21,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.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 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:12:24,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:12:24,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:12:24,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:12:24,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:12:24,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:12:24,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:12:24,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:12:24,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:12:24,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:12:24,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:12:24,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:12:24,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:12:24,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:12:24,234 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:12:24,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:12:24,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:12:24,234 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:12:24,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:12:24,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:12:24,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:12:24,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:12:24,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:12:24,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:12:24,238 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 -> 5d7e41890311b17b4172246b2c6ff0c305b3b8a9717c6f0cb798c28922acd89f [2025-02-06 01:12:24,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:12:24,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:12:24,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:12:24,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:12:24,543 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:12:24,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:12:25,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2147e5d/e602abc06e18423593ab620371f77f0e/FLAG85755648f [2025-02-06 01:12:26,096 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:12:26,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:12:26,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2147e5d/e602abc06e18423593ab620371f77f0e/FLAG85755648f [2025-02-06 01:12:26,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2147e5d/e602abc06e18423593ab620371f77f0e [2025-02-06 01:12:26,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:12:26,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:12:26,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:12:26,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:12:26,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:12:26,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69950f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26, skipping insertion in model container [2025-02-06 01:12:26,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:12:26,567 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_loopvsstraightlinecode_25-1loop_file-45.i[915,928] [2025-02-06 01:12:26,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:12:26,624 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:12:26,633 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_loopvsstraightlinecode_25-1loop_file-45.i[915,928] [2025-02-06 01:12:26,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:12:26,666 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:12:26,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26 WrapperNode [2025-02-06 01:12:26,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:12:26,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:12:26,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:12:26,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:12:26,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,716 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-02-06 01:12:26,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:12:26,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:12:26,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:12:26,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:12:26,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,749 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 01:12:26,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:12:26,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:12:26,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:12:26,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:12:26,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (1/1) ... [2025-02-06 01:12:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:12:26,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:12:26,809 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 01:12:26,816 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 01:12:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:12:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:12:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:12:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:12:26,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:12:26,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:12:26,896 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:12:26,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:12:28,349 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:12:28,350 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:12:28,357 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:12:28,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:12:28,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:28 BoogieIcfgContainer [2025-02-06 01:12:28,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:12:28,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:12:28,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:12:28,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:12:28,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:12:26" (1/3) ... [2025-02-06 01:12:28,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c608f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:28, skipping insertion in model container [2025-02-06 01:12:28,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:12:26" (2/3) ... [2025-02-06 01:12:28,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c608f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:12:28, skipping insertion in model container [2025-02-06 01:12:28,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:12:28" (3/3) ... [2025-02-06 01:12:28,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i [2025-02-06 01:12:28,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:12:28,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:12:28,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:12:28,453 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;@c783e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:12:28,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:12:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:12:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:12:28,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:12:28,479 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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 01:12:28,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:12:28,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:12:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1462616748, now seen corresponding path program 1 times [2025-02-06 01:12:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:12:28,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664952602] [2025-02-06 01:12:28,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:12:28,492 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 01:12:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:12:28,495 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 01:12:28,496 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 01:12:28,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:12:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:12:28,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:12:28,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:12:28,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:12:28,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:12:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-02-06 01:12:28,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:12:28,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:12:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664952602] [2025-02-06 01:12:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664952602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:12:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:12:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:12:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799365213] [2025-02-06 01:12:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:12:28,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:12:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:12:28,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:12:28,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:12:28,841 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 01:12:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:12:28,865 INFO L93 Difference]: Finished difference Result 103 states and 170 transitions. [2025-02-06 01:12:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:12:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2025-02-06 01:12:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:12:28,874 INFO L225 Difference]: With dead ends: 103 [2025-02-06 01:12:28,875 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 01:12:28,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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 01:12:28,882 INFO L435 NwaCegarLoop]: 75 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, 75 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 01:12:28,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:12:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 01:12:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 01:12:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 01:12:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-02-06 01:12:28,914 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 119 [2025-02-06 01:12:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:12:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-02-06 01:12:28,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 01:12:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-02-06 01:12:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 01:12:28,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:12:28,919 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 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 01:12:28,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:12:29,119 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 01:12:29,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:12:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:12:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1140455945, now seen corresponding path program 1 times [2025-02-06 01:12:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:12:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622324652] [2025-02-06 01:12:29,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:12:29,121 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 01:12:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:12:29,125 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 01:12:29,126 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 01:12:29,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 01:12:29,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 01:12:29,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:12:29,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:12:29,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 01:12:29,429 INFO L279 TraceCheckSpWp]: Computing forward predicates...