./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.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_floatingpointinfluence_has-floats_file-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:30:04,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:30:04,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:30:04,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:30:04,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:30:04,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:30:04,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:30:04,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:30:04,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:30:04,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:30:04,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:30:04,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:30:04,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:30:04,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:30:04,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:30:04,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:30:04,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:30:04,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:30:04,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:30:04,277 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2025-02-06 00:30:04,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:30:04,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:30:04,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:30:04,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:30:04,513 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:30:04,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:05,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51915021/de8dba79a9334841b47319414ca0d268/FLAG4e1c575d8 [2025-02-06 00:30:05,812 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:30:05,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:05,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51915021/de8dba79a9334841b47319414ca0d268/FLAG4e1c575d8 [2025-02-06 00:30:05,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51915021/de8dba79a9334841b47319414ca0d268 [2025-02-06 00:30:05,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:30:05,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:30:05,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:30:05,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:30:05,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:30:05,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:30:05" (1/1) ... [2025-02-06 00:30:05,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61706ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:05, skipping insertion in model container [2025-02-06 00:30:05,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:30:05" (1/1) ... [2025-02-06 00:30:05,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:30:05,984 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-02-06 00:30:06,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:30:06,021 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:30:06,028 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-02-06 00:30:06,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:30:06,060 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:30:06,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06 WrapperNode [2025-02-06 00:30:06,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:30:06,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:30:06,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:30:06,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:30:06,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,085 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-02-06 00:30:06,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:30:06,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:30:06,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:30:06,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:30:06,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,117 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 00:30:06,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:30:06,126 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:30:06,126 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:30:06,126 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:30:06,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (1/1) ... [2025-02-06 00:30:06,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:30:06,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:06,154 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 00:30:06,156 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 00:30:06,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:30:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:30:06,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:30:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:30:06,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:30:06,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:30:06,225 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:30:06,226 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:30:06,397 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-02-06 00:30:06,422 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:30:06,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:30:06,441 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:30:06,443 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:30:06,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:30:06 BoogieIcfgContainer [2025-02-06 00:30:06,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:30:06,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:30:06,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:30:06,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:30:06,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:30:05" (1/3) ... [2025-02-06 00:30:06,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54b771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:30:06, skipping insertion in model container [2025-02-06 00:30:06,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:06" (2/3) ... [2025-02-06 00:30:06,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54b771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:30:06, skipping insertion in model container [2025-02-06 00:30:06,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:30:06" (3/3) ... [2025-02-06 00:30:06,452 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:06,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:30:06,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-92.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:30:06,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:30:06,518 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;@489af394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:30:06,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:30:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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 00:30:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 00:30:06,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:06,532 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, 1, 1, 1, 1] [2025-02-06 00:30:06,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1816423975, now seen corresponding path program 1 times [2025-02-06 00:30:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:06,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266609297] [2025-02-06 00:30:06,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:06,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 00:30:06,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 00:30:06,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:06,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:06,757 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 00:30:06,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266609297] [2025-02-06 00:30:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266609297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790100288] [2025-02-06 00:30:06,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:06,763 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 00:30:06,764 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 00:30:06,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 00:30:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 00:30:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:06,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:30:06,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:06,915 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 00:30:06,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:30:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790100288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:30:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:30:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267873454] [2025-02-06 00:30:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:30:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:06,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:30:06,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:30:06,951 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 00:30:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:06,982 INFO L93 Difference]: Finished difference Result 118 states and 194 transitions. [2025-02-06 00:30:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:30:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 123 [2025-02-06 00:30:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:06,993 INFO L225 Difference]: With dead ends: 118 [2025-02-06 00:30:06,993 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 00:30:06,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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 00:30:07,000 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:07,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 00:30:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 00:30:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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 00:30:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2025-02-06 00:30:07,029 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 123 [2025-02-06 00:30:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:07,029 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-02-06 00:30:07,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 00:30:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2025-02-06 00:30:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 00:30:07,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:07,031 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, 1, 1, 1, 1] [2025-02-06 00:30:07,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 00:30:07,232 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 00:30:07,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:07,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -104778966, now seen corresponding path program 1 times [2025-02-06 00:30:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:07,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-02-06 00:30:07,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 00:30:07,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 00:30:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-02-06 00:30:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324549965] [2025-02-06 00:30:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324549965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:30:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289037079] [2025-02-06 00:30:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:30:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:07,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:30:07,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:07,639 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 00:30:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:07,794 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2025-02-06 00:30:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:30:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2025-02-06 00:30:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:07,798 INFO L225 Difference]: With dead ends: 117 [2025-02-06 00:30:07,798 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 00:30:07,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:30:07,799 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:07,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:30:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 00:30:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-02-06 00:30:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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 00:30:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2025-02-06 00:30:07,810 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 123 [2025-02-06 00:30:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:07,812 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2025-02-06 00:30:07,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-02-06 00:30:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2025-02-06 00:30:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 00:30:07,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:07,813 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, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:07,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:30:07,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1560229544, now seen corresponding path program 1 times [2025-02-06 00:30:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136230847] [2025-02-06 00:30:07,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:07,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:07,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:07,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 00:30:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136230847] [2025-02-06 00:30:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136230847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967780431] [2025-02-06 00:30:08,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:08,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:08,221 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 00:30:08,224 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 00:30:08,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:08,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:08,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:08,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:08,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:30:08,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-02-06 00:30:08,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:30:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-02-06 00:30:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967780431] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:30:08,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:30:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 00:30:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192174342] [2025-02-06 00:30:08,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:30:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:30:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:08,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:30:08,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:30:08,592 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:30:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:09,100 INFO L93 Difference]: Finished difference Result 249 states and 345 transitions. [2025-02-06 00:30:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 00:30:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2025-02-06 00:30:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:09,103 INFO L225 Difference]: With dead ends: 249 [2025-02-06 00:30:09,103 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 00:30:09,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:30:09,104 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 175 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:09,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 430 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 00:30:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 65. [2025-02-06 00:30:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:30:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2025-02-06 00:30:09,119 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 125 [2025-02-06 00:30:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:09,119 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2025-02-06 00:30:09,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 00:30:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2025-02-06 00:30:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 00:30:09,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:09,123 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, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:09,129 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 00:30:09,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:09,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:09,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash -247224919, now seen corresponding path program 1 times [2025-02-06 00:30:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832585599] [2025-02-06 00:30:09,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:09,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:09,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:09,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:30:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809676552] [2025-02-06 00:30:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:09,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:30:09,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:30:09,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:09,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 00:30:09,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 00:30:09,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:30:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832585599] [2025-02-06 00:30:10,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 00:30:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809676552] [2025-02-06 00:30:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809676552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:10,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:30:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-06 00:30:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595198448] [2025-02-06 00:30:10,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 00:30:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:30:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:10,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:30:10,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:30:10,057 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 00:30:12,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-06 00:30:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:12,160 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2025-02-06 00:30:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:30:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 125 [2025-02-06 00:30:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:12,162 INFO L225 Difference]: With dead ends: 139 [2025-02-06 00:30:12,162 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 00:30:12,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-02-06 00:30:12,165 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:12,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 154 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 00:30:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 00:30:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-06 00:30:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 00:30:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-02-06 00:30:12,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 125 [2025-02-06 00:30:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:12,180 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-02-06 00:30:12,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-06 00:30:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-02-06 00:30:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 00:30:12,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:12,182 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, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:12,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 00:30:12,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:12,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash -236721815, now seen corresponding path program 1 times [2025-02-06 00:30:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:12,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986855303] [2025-02-06 00:30:12,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:30:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227438383] [2025-02-06 00:30:12,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:12,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:30:12,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:30:12,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:12,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:30:12,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:30:12,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 00:30:12,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 00:30:12,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:30:12,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:30:12,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:30:12,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:30:12,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 00:30:12,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:12,799 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 00:30:12,864 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:30:12,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:30:12 BoogieIcfgContainer [2025-02-06 00:30:12,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:30:12,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:30:12,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:30:12,867 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:30:12,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:30:06" (3/4) ... [2025-02-06 00:30:12,870 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:30:12,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:30:12,871 INFO L158 Benchmark]: Toolchain (without parser) took 6989.58ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.8MB in the beginning and 142.3MB in the end (delta: -36.6MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2025-02-06 00:30:12,871 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:30:12,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.38ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:12,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.42ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:12,872 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:30:12,872 INFO L158 Benchmark]: IcfgBuilder took 317.07ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 70.5MB in the end (delta: 17.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:12,873 INFO L158 Benchmark]: TraceAbstraction took 6421.36ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.4MB in the beginning and 142.3MB in the end (delta: -73.0MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2025-02-06 00:30:12,873 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 302.0MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:30:12,874 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.85ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.38ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.42ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.07ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 70.5MB in the end (delta: 17.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6421.36ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 69.4MB in the beginning and 142.3MB in the end (delta: -73.0MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 302.0MB. Free memory is still 142.3MB. 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 someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] double var_1_9 = 15.5; [L31] signed short int var_1_10 = 500; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_13 = 0; [L34] unsigned short int var_1_14 = 100; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 0; [L37] float var_1_17 = 2.4; VAL [isInitial=0, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L64] var_1_3 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L67] var_1_4 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L70] var_1_5 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L73] var_1_6 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L76] var_1_8 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && 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=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L77] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L78] var_1_9 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L80] var_1_14 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L84] var_1_15 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3); [L43] COND TRUE stepLocal_0 >= var_1_4 [L44] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L48] var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L49] signed long int stepLocal_1 = var_1_6 / var_1_14; VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L50] COND FALSE !(stepLocal_1 < -100) [L53] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L55] var_1_17 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L56] COND TRUE ! var_1_13 [L57] var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94-L95] return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 839 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 296 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 44, 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, 4 MinimizatonAttempts, 136 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1119 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 862 ConstructedInterpolants, 1 QuantifiedInterpolants, 2346 SizeOfPredicates, 4 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4695/4788 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 00:30:12,898 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_floatingpointinfluence_has-floats_file-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:30:14,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:30:14,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:30:14,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:30:14,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:30:14,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:30:14,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:30:14,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:30:14,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:30:14,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:30:14,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:30:14,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:30:14,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:30:14,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:30:14,834 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:30:14,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:30:14,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:30:14,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:30:14,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:30:14,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:30:14,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:30:14,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:30:14,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:30:14,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:30:14,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:30:14,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:30:14,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:30:14,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:30:14,838 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2025-02-06 00:30:15,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:30:15,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:30:15,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:30:15,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:30:15,062 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:30:15,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:16,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48592cf4d/02c1124e33604ec28fb86e72e083fd20/FLAGcfb99b2c1 [2025-02-06 00:30:16,426 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:30:16,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:16,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48592cf4d/02c1124e33604ec28fb86e72e083fd20/FLAGcfb99b2c1 [2025-02-06 00:30:16,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48592cf4d/02c1124e33604ec28fb86e72e083fd20 [2025-02-06 00:30:16,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:30:16,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:30:16,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:30:16,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:30:16,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:30:16,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:16,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed583c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16, skipping insertion in model container [2025-02-06 00:30:16,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:16,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:30:16,885 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-02-06 00:30:16,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:30:16,922 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:30:16,929 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_floatingpointinfluence_has-floats_file-92.i[917,930] [2025-02-06 00:30:16,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:30:16,953 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:30:16,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16 WrapperNode [2025-02-06 00:30:16,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:30:16,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:30:16,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:30:16,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:30:16,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:16,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:16,991 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-02-06 00:30:16,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:30:16,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:30:16,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:30:16,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:30:17,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,022 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 00:30:17,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:30:17,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:30:17,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:30:17,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:30:17,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (1/1) ... [2025-02-06 00:30:17,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:30:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:17,061 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 00:30:17,064 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 00:30:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:30:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:30:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:30:17,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:30:17,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:30:17,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:30:17,152 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:30:17,154 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:30:17,529 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 00:30:17,530 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:30:17,535 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:30:17,535 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:30:17,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:30:17 BoogieIcfgContainer [2025-02-06 00:30:17,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:30:17,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:30:17,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:30:17,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:30:17,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:30:16" (1/3) ... [2025-02-06 00:30:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68647f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:30:17, skipping insertion in model container [2025-02-06 00:30:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:30:16" (2/3) ... [2025-02-06 00:30:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68647f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:30:17, skipping insertion in model container [2025-02-06 00:30:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:30:17" (3/3) ... [2025-02-06 00:30:17,542 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2025-02-06 00:30:17,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:30:17,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-92.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:30:17,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:30:17,600 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;@2e72f541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:30:17,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:30:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 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 00:30:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 00:30:17,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:17,615 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 00:30:17,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:17,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1547422302, now seen corresponding path program 1 times [2025-02-06 00:30:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:30:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072080810] [2025-02-06 00:30:17,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:30:17,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:30:17,631 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 00:30:17,633 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 00:30:17,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 00:30:17,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 00:30:17,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:17,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:17,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:30:17,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-02-06 00:30:17,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:30:17,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:30:17,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072080810] [2025-02-06 00:30:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072080810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:30:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049243292] [2025-02-06 00:30:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:30:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:30:17,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:30:17,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:30:17,870 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 00:30:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:17,895 INFO L93 Difference]: Finished difference Result 98 states and 164 transitions. [2025-02-06 00:30:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:30:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2025-02-06 00:30:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:17,899 INFO L225 Difference]: With dead ends: 98 [2025-02-06 00:30:17,900 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 00:30:17,902 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 00:30:17,903 INFO L435 NwaCegarLoop]: 70 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, 70 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 00:30:17,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 00:30:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-06 00:30:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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 00:30:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-02-06 00:30:17,931 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 119 [2025-02-06 00:30:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:17,932 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-02-06 00:30:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 00:30:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-02-06 00:30:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 00:30:17,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:17,935 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 00:30:17,944 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 00:30:18,136 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 00:30:18,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:18,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash 529631457, now seen corresponding path program 1 times [2025-02-06 00:30:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:30:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921719337] [2025-02-06 00:30:18,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:18,137 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 00:30:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:30:18,139 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 00:30:18,140 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 00:30:18,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 00:30:18,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 00:30:18,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:18,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:18,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 00:30:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates...