./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.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-82.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 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:28:45,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:28:45,680 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:28:45,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:28:45,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:28:45,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:28:45,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:28:45,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:28:45,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:28:45,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:28:45,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:28:45,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:28:45,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:28:45,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:28:45,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:28:45,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:28:45,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:28:45,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:28:45,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:28:45,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:28:45,706 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 -> 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 [2025-02-06 00:28:45,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:28:45,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:28:45,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:28:45,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:28:45,941 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:28:45,942 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-82.i [2025-02-06 00:28:47,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fadbdca/24feb888a97f42f292b019566260c4dd/FLAG61b569138 [2025-02-06 00:28:47,362 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:28:47,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2025-02-06 00:28:47,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fadbdca/24feb888a97f42f292b019566260c4dd/FLAG61b569138 [2025-02-06 00:28:47,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47fadbdca/24feb888a97f42f292b019566260c4dd [2025-02-06 00:28:47,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:28:47,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:28:47,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:28:47,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:28:47,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:28:47,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:47,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dd29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47, skipping insertion in model container [2025-02-06 00:28:47,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:47,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:28:47,843 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-82.i[917,930] [2025-02-06 00:28:47,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:28:47,909 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:28:47,919 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-82.i[917,930] [2025-02-06 00:28:47,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:28:47,962 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:28:47,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47 WrapperNode [2025-02-06 00:28:47,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:28:47,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:28:47,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:28:47,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:28:47,969 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:28:47" (1/1) ... [2025-02-06 00:28:47,979 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:28:47" (1/1) ... [2025-02-06 00:28:48,017 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-02-06 00:28:48,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:28:48,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:28:48,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:28:48,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:28:48,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,053 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:28:48,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:28:48,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:28:48,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:28:48,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:28:48,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (1/1) ... [2025-02-06 00:28:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:28:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:28:48,104 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:28:48,106 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:28:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:28:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:28:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:28:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:28:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:28:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:28:48,178 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:28:48,179 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:28:48,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-02-06 00:28:48,404 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 00:28:48,404 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:28:48,417 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:28:48,422 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:28:48,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:28:48 BoogieIcfgContainer [2025-02-06 00:28:48,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:28:48,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:28:48,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:28:48,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:28:48,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:28:47" (1/3) ... [2025-02-06 00:28:48,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c30bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:28:48, skipping insertion in model container [2025-02-06 00:28:48,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:47" (2/3) ... [2025-02-06 00:28:48,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c30bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:28:48, skipping insertion in model container [2025-02-06 00:28:48,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:28:48" (3/3) ... [2025-02-06 00:28:48,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-82.i [2025-02-06 00:28:48,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:28:48,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-82.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:28:48,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:28:48,497 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;@267761d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:28:48,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:28:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 00:28:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 00:28:48,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:48,510 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:48,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1697843616, now seen corresponding path program 1 times [2025-02-06 00:28:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:28:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345923651] [2025-02-06 00:28:48,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:28:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 00:28:48,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 00:28:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:48,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 00:28:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:28:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345923651] [2025-02-06 00:28:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345923651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:28:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031985931] [2025-02-06 00:28:48,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:48,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:28:48,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:28:48,695 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:28:48,696 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:28:48,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 00:28:48,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 00:28:48,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:48,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:48,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:28:48,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:28:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 00:28:48,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:28:48,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031985931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:28:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:28:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:28:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764499660] [2025-02-06 00:28:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:28:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:28:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:28:48,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:28:48,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:28:48,871 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 00:28:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:28:48,888 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2025-02-06 00:28:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:28:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-02-06 00:28:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:28:48,893 INFO L225 Difference]: With dead ends: 108 [2025-02-06 00:28:48,893 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 00:28:48,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:28:48,897 INFO L435 NwaCegarLoop]: 76 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, 76 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:28:48,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:28:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 00:28:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 00:28:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 00:28:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-02-06 00:28:48,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 95 [2025-02-06 00:28:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:28:48,933 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-02-06 00:28:48,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 00:28:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-02-06 00:28:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 00:28:48,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:48,935 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:48,945 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:28:49,136 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:28:49,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash -330914782, now seen corresponding path program 1 times [2025-02-06 00:28:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:28:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327854318] [2025-02-06 00:28:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:28:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 00:28:49,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 00:28:49,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:49,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 00:28:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:28:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327854318] [2025-02-06 00:28:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327854318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:28:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:28:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:28:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109989732] [2025-02-06 00:28:49,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:28:49,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:28:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:28:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:28:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:28:49,480 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:28:49,578 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2025-02-06 00:28:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:28:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-02-06 00:28:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:28:49,583 INFO L225 Difference]: With dead ends: 123 [2025-02-06 00:28:49,584 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 00:28:49,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:28:49,585 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:28:49,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 268 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:28:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 00:28:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2025-02-06 00:28:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 00:28:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-02-06 00:28:49,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 95 [2025-02-06 00:28:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:28:49,598 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-02-06 00:28:49,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-02-06 00:28:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 00:28:49,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:49,602 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:28:49,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1007924832, now seen corresponding path program 1 times [2025-02-06 00:28:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:28:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236810576] [2025-02-06 00:28:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:28:49,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 00:28:49,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 00:28:49,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 00:28:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:28:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236810576] [2025-02-06 00:28:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236810576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:28:49,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:28:49,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:28:49,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067908404] [2025-02-06 00:28:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:28:49,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:28:49,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:28:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:28:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:28:49,855 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:28:50,032 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2025-02-06 00:28:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:28:50,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-02-06 00:28:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:28:50,034 INFO L225 Difference]: With dead ends: 181 [2025-02-06 00:28:50,034 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 00:28:50,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:28:50,035 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:28:50,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 280 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:28:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 00:28:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2025-02-06 00:28:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 00:28:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-02-06 00:28:50,057 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 97 [2025-02-06 00:28:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:28:50,058 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-02-06 00:28:50,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-02-06 00:28:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 00:28:50,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:50,059 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:50,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:28:50,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:50,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash -878842113, now seen corresponding path program 1 times [2025-02-06 00:28:50,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:28:50,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975000211] [2025-02-06 00:28:50,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:50,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:28:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 00:28:50,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 00:28:50,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:50,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:28:50,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:28:50,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 00:28:50,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 00:28:50,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:50,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:28:50,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:28:50,225 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:28:50,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:28:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:28:50,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 00:28:50,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:28:50,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:28:50 BoogieIcfgContainer [2025-02-06 00:28:50,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:28:50,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:28:50,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:28:50,289 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:28:50,290 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:28:48" (3/4) ... [2025-02-06 00:28:50,292 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:28:50,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:28:50,295 INFO L158 Benchmark]: Toolchain (without parser) took 2618.94ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 73.6MB in the end (delta: 32.3MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-02-06 00:28:50,295 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:28:50,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.52ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:28:50,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.78ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 89.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:28:50,296 INFO L158 Benchmark]: Boogie Preprocessor took 57.38ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:28:50,297 INFO L158 Benchmark]: IcfgBuilder took 347.89ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 63.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:28:50,297 INFO L158 Benchmark]: TraceAbstraction took 1862.51ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 73.7MB in the end (delta: -11.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:28:50,297 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 73.6MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:28:50,298 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.16ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.52ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.9MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.78ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 89.3MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.38ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.89ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 63.0MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1862.51ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 73.7MB in the end (delta: -11.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 73.6MB in the end (delta: 24.1kB). 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 74, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 63.5; [L25] float var_1_4 = 255.5; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 16; [L30] unsigned char var_1_12 = 2; [L31] unsigned char var_1_14 = 5; [L32] unsigned char var_1_15 = 10; [L33] double var_1_16 = 3.75; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 255.5; [L36] unsigned char last_1_var_1_5 = 32; [L37] unsigned char last_1_var_1_12 = 2; [L38] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_5 = var_1_5 [L95] last_1_var_1_12 = var_1_12 [L96] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L73] var_1_3 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L75] var_1_4 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L81] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L85] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L85] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L86] var_1_14 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L88] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L88] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L91] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L91] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L107] RET updateVariables() [L108] CALL step() [L42] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L42] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L43] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L46] var_1_5 = (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=253, var_1_9=254] [L48] COND FALSE !(! var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=253, var_1_9=254] [L53] var_1_16 = var_1_4 [L54] var_1_17 = var_1_9 [L55] var_1_18 = var_1_3 [L56] unsigned char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, stepLocal_1=254, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L57] COND FALSE !((var_1_5 + var_1_11) >= stepLocal_1) [L66] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99-L100] return ((((((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) && (((var_1_5 + var_1_11) >= var_1_9) ? ((((((var_1_4) > ((var_1_1 * var_1_3))) ? (var_1_4) : ((var_1_1 * var_1_3)))) <= var_1_1) ? (var_1_12 == ((unsigned char) ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))))) : (var_1_2 ? (var_1_12 == ((unsigned char) (var_1_11 + var_1_15))) : 1)) : (var_1_12 == ((unsigned char) var_1_9)))) && (var_1_16 == ((double) var_1_4))) && (var_1_17 == ((unsigned char) var_1_9))) && (var_1_18 == ((double) var_1_3)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 221 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1430/1456 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:28:50,321 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-82.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 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:28:52,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:28:52,409 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:28:52,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:28:52,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:28:52,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:28:52,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:28:52,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:28:52,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:28:52,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:28:52,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:28:52,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:28:52,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:28:52,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:28:52,431 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:28:52,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:28:52,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:28:52,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:28:52,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:28:52,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:28:52,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:28:52,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:28:52,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:28:52,434 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 -> 849083912b26b4b30248ff5689bdb4cde8d919d90edb130c279b0f61a6bab9d5 [2025-02-06 00:28:52,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:28:52,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:28:52,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:28:52,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:28:52,662 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:28:52,662 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-82.i [2025-02-06 00:28:53,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438abeccd/5b154b898bce4901a9647ca02e12a2d6/FLAG730fad5a0 [2025-02-06 00:28:54,059 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:28:54,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-82.i [2025-02-06 00:28:54,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438abeccd/5b154b898bce4901a9647ca02e12a2d6/FLAG730fad5a0 [2025-02-06 00:28:54,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/438abeccd/5b154b898bce4901a9647ca02e12a2d6 [2025-02-06 00:28:54,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:28:54,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:28:54,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:28:54,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:28:54,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:28:54,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6848547a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54, skipping insertion in model container [2025-02-06 00:28:54,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:28:54,206 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-82.i[917,930] [2025-02-06 00:28:54,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:28:54,267 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:28:54,275 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-82.i[917,930] [2025-02-06 00:28:54,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:28:54,312 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:28:54,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54 WrapperNode [2025-02-06 00:28:54,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:28:54,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:28:54,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:28:54,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:28:54,318 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:28:54" (1/1) ... [2025-02-06 00:28:54,324 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:28:54" (1/1) ... [2025-02-06 00:28:54,336 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-02-06 00:28:54,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:28:54,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:28:54,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:28:54,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:28:54,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,353 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:28:54,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:28:54,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:28:54,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:28:54,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:28:54,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (1/1) ... [2025-02-06 00:28:54,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:28:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:28:54,393 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:28:54,397 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:28:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:28:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:28:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:28:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:28:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:28:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:28:54,464 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:28:54,465 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:28:55,512 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 00:28:55,512 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:28:55,518 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:28:55,519 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:28:55,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:28:55 BoogieIcfgContainer [2025-02-06 00:28:55,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:28:55,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:28:55,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:28:55,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:28:55,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:28:54" (1/3) ... [2025-02-06 00:28:55,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751e5342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:28:55, skipping insertion in model container [2025-02-06 00:28:55,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:28:54" (2/3) ... [2025-02-06 00:28:55,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751e5342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:28:55, skipping insertion in model container [2025-02-06 00:28:55,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:28:55" (3/3) ... [2025-02-06 00:28:55,525 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-82.i [2025-02-06 00:28:55,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:28:55,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-82.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:28:55,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:28:55,579 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;@212d4cb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:28:55,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:28:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 00:28:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 00:28:55,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:55,588 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -532682735, now seen corresponding path program 1 times [2025-02-06 00:28:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:28:55,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904955169] [2025-02-06 00:28:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:55,599 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:28:55,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:28:55,603 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:28:55,605 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:28:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 00:28:55,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 00:28:55,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:55,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:55,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:28:55,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:28:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 00:28:55,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:28:55,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:28:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904955169] [2025-02-06 00:28:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904955169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:28:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:28:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:28:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758079984] [2025-02-06 00:28:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:28:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:28:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:28:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:28:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:28:55,818 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:28:55,832 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-02-06 00:28:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:28:55,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-02-06 00:28:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:28:55,837 INFO L225 Difference]: With dead ends: 88 [2025-02-06 00:28:55,837 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 00:28:55,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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:28:55,845 INFO L435 NwaCegarLoop]: 63 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, 63 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:28:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:28:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 00:28:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-06 00:28:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 00:28:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-02-06 00:28:55,897 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2025-02-06 00:28:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:28:55,898 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-02-06 00:28:55,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-02-06 00:28:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 00:28:55,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:55,900 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 00:28:56,101 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:28:56,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1280653613, now seen corresponding path program 1 times [2025-02-06 00:28:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:28:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087668365] [2025-02-06 00:28:56,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:56,103 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:28:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:28:56,108 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:28:56,116 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:28:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 00:28:56,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 00:28:56,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:56,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:56,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 00:28:56,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:28:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 00:28:56,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:28:56,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:28:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087668365] [2025-02-06 00:28:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087668365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:28:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:28:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:28:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003011731] [2025-02-06 00:28:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:28:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:28:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:28:56,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:28:56,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:28:56,521 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:28:58,092 INFO L93 Difference]: Finished difference Result 127 states and 184 transitions. [2025-02-06 00:28:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:28:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-02-06 00:28:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:28:58,104 INFO L225 Difference]: With dead ends: 127 [2025-02-06 00:28:58,104 INFO L226 Difference]: Without dead ends: 86 [2025-02-06 00:28:58,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:28:58,105 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:28:58,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 00:28:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-06 00:28:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2025-02-06 00:28:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 00:28:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2025-02-06 00:28:58,117 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 91 [2025-02-06 00:28:58,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:28:58,118 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2025-02-06 00:28:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 00:28:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2025-02-06 00:28:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 00:28:58,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:28:58,119 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 00:28:58,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:28:58,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:28:58,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:28:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 462156722, now seen corresponding path program 1 times [2025-02-06 00:28:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:28:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415344286] [2025-02-06 00:28:58,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:28:58,322 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:28:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:28:58,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 00:28:58,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 00:28:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 00:28:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 00:28:58,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:28:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:28:58,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 00:28:58,450 INFO L279 TraceCheckSpWp]: Computing forward predicates...