./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.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 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:10:47,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:10:47,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:10:47,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:10:47,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:10:48,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:10:48,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:10:48,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:10:48,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:10:48,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:10:48,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:10:48,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:10:48,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:10:48,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:10:48,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:10:48,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:10:48,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:10:48,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:10:48,013 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 -> 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 [2025-02-06 02:10:48,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:10:48,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:10:48,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:10:48,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:10:48,233 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:10:48,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2025-02-06 02:10:49,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/336bd5de0/10fb1878667f425e89568beab32c3123/FLAGff468dca2 [2025-02-06 02:10:49,634 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:10:49,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2025-02-06 02:10:49,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/336bd5de0/10fb1878667f425e89568beab32c3123/FLAGff468dca2 [2025-02-06 02:10:49,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/336bd5de0/10fb1878667f425e89568beab32c3123 [2025-02-06 02:10:49,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:10:49,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:10:49,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:10:49,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:10:49,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:10:49,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:10:49" (1/1) ... [2025-02-06 02:10:49,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:49, skipping insertion in model container [2025-02-06 02:10:49,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:10:49" (1/1) ... [2025-02-06 02:10:49,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:10:50,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i[915,928] [2025-02-06 02:10:50,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:10:50,103 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:10:50,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i[915,928] [2025-02-06 02:10:50,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:10:50,141 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:10:50,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50 WrapperNode [2025-02-06 02:10:50,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:10:50,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:10:50,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:10:50,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:10:50,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,171 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2025-02-06 02:10:50,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:10:50,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:10:50,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:10:50,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:10:50,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:10:50,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:10:50,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:10:50,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:10:50,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:10:50,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (1/1) ... [2025-02-06 02:10:50,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:10:50,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:10:50,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:10:50,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:10:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:10:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:10:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:10:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:10:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:10:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:10:50,313 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:10:50,315 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:10:50,421 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:10:50,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:10:50,428 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:10:50,428 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:10:50,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:10:50 BoogieIcfgContainer [2025-02-06 02:10:50,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:10:50,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:10:50,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:10:50,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:10:50,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:10:49" (1/3) ... [2025-02-06 02:10:50,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbebcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:10:50, skipping insertion in model container [2025-02-06 02:10:50,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:50" (2/3) ... [2025-02-06 02:10:50,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbebcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:10:50, skipping insertion in model container [2025-02-06 02:10:50,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:10:50" (3/3) ... [2025-02-06 02:10:50,436 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2025-02-06 02:10:50,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:10:50,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-53.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:10:50,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:10:50,504 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;@d94cde8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:10:50,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:10:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 02:10:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 02:10:50,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:10:50,516 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:10:50,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:10:50,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:10:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash 476408593, now seen corresponding path program 1 times [2025-02-06 02:10:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:10:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055882472] [2025-02-06 02:10:50,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:10:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:10:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:10:50,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:10:50,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:10:50,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:10:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 02:10:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:10:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055882472] [2025-02-06 02:10:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055882472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:10:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305814731] [2025-02-06 02:10:50,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:10:50,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:10:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:10:50,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:10:50,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:10:50,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:10:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:10:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:10:50,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:10:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:10:50,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:10:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 02:10:50,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:10:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305814731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:10:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:10:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:10:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129586813] [2025-02-06 02:10:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:10:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:10:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:10:50,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:10:50,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:10:50,846 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 02:10:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:10:50,858 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2025-02-06 02:10:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:10:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-02-06 02:10:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:10:50,863 INFO L225 Difference]: With dead ends: 70 [2025-02-06 02:10:50,864 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 02:10:50,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:10:50,867 INFO L435 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:10:50,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:10:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 02:10:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 02:10:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 02:10:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-02-06 02:10:50,898 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 72 [2025-02-06 02:10:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:10:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-02-06 02:10:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 02:10:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2025-02-06 02:10:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 02:10:50,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:10:50,903 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:10:50,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:10:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:10:51,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:10:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:10:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1098434860, now seen corresponding path program 1 times [2025-02-06 02:10:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:10:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190637284] [2025-02-06 02:10:51,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:10:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:10:51,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:10:51,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:10:51,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:10:51,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:10:51,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:10:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:10:51,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:10:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:10:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:10:51,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:10:51,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:10:51,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:10:51,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:10:51,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 02:10:51,244 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:10:51,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:10:51 BoogieIcfgContainer [2025-02-06 02:10:51,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:10:51,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:10:51,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:10:51,247 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:10:51,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:10:50" (3/4) ... [2025-02-06 02:10:51,249 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:10:51,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:10:51,251 INFO L158 Benchmark]: Toolchain (without parser) took 1316.04ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 36.8MB in the end (delta: 68.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 02:10:51,251 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:10:51,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.96ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 93.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:10:51,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.99ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:10:51,252 INFO L158 Benchmark]: Boogie Preprocessor took 36.10ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:10:51,253 INFO L158 Benchmark]: IcfgBuilder took 215.55ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:10:51,253 INFO L158 Benchmark]: TraceAbstraction took 816.28ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 36.8MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 02:10:51,254 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:10:51,255 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.96ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 93.4MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.99ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.10ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 215.55ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.7MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 816.28ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 36.8MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 142.6MB. Free memory is still 36.8MB. 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 53, overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 8; [L23] float var_1_2 = 1.25; [L24] float var_1_3 = 1.375; [L25] float var_1_4 = 1.6; [L26] float var_1_5 = 256.25; [L27] float var_1_6 = 1.9; [L28] signed long int var_1_7 = -32; [L29] signed long int var_1_8 = -10000000; VAL [isInitial=0, var_1_1=8, var_1_2=5/4, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_float() [L43] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L43] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_3=11/8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L44] var_1_3 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L45] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L46] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L46] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=8, var_1_4=8/5, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L47] var_1_4 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L48] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L49] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L49] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_1=8, var_1_5=1025/4, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L50] var_1_5 = __VERIFIER_nondet_float() [L51] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L51] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_6=19/10, var_1_7=-32, var_1_8=-10000000] [L52] var_1_6 = __VERIFIER_nondet_float() [L53] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-32, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=-32, var_1_8=-10000000] [L53] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=8, var_1_7=-32, var_1_8=-10000000] [L54] var_1_7 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L55] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L56] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L56] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=-10000000] [L57] var_1_8 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L58] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L59] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L59] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L72] RET updateVariables() [L73] CALL step() [L33] COND FALSE !((var_1_2 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_5 * var_1_6)) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L73] RET step() [L74] CALL, EXPR property() [L64-L65] return ((var_1_2 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_5 * var_1_6)) ? ((var_1_3 == var_1_6) ? (var_1_1 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_1 == ((signed long int) var_1_8))) : 1 ; VAL [\result=0, isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=8, var_1_7=1073741823, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 47 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 02:10:51,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.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 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:10:53,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:10:53,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:10:53,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:10:53,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:10:53,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:10:53,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:10:53,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:10:53,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:10:53,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:10:53,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:10:53,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:10:53,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:10:53,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:10:53,213 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:10:53,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:10:53,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:10:53,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:10:53,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:10:53,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:10:53,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:10:53,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:10:53,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:10:53,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:10:53,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:10:53,216 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 -> 8031214ed9c619943b4a735ea98fb6c6f1f9f3536470f440c97b936292613cf6 [2025-02-06 02:10:53,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:10:53,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:10:53,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:10:53,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:10:53,459 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:10:53,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2025-02-06 02:10:54,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d028799cc/69ff3e11eca04cbc97de3deed7511858/FLAG033d765f6 [2025-02-06 02:10:54,830 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:10:54,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i [2025-02-06 02:10:54,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d028799cc/69ff3e11eca04cbc97de3deed7511858/FLAG033d765f6 [2025-02-06 02:10:54,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d028799cc/69ff3e11eca04cbc97de3deed7511858 [2025-02-06 02:10:54,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:10:54,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:10:54,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:10:54,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:10:54,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:10:54,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:10:54" (1/1) ... [2025-02-06 02:10:54,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5c8c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:54, skipping insertion in model container [2025-02-06 02:10:54,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:10:54" (1/1) ... [2025-02-06 02:10:54,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:10:54,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i[915,928] [2025-02-06 02:10:55,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:10:55,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:10:55,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-53.i[915,928] [2025-02-06 02:10:55,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:10:55,073 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:10:55,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55 WrapperNode [2025-02-06 02:10:55,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:10:55,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:10:55,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:10:55,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:10:55,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,101 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-02-06 02:10:55,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:10:55,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:10:55,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:10:55,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:10:55,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,122 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:10:55,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:10:55,140 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:10:55,140 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:10:55,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:10:55,140 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (1/1) ... [2025-02-06 02:10:55,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:10:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:10:55,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:10:55,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:10:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:10:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:10:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:10:55,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:10:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:10:55,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:10:55,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:10:55,234 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:11:02,380 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:11:02,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:11:02,388 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:11:02,391 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:11:02,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:02 BoogieIcfgContainer [2025-02-06 02:11:02,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:11:02,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:11:02,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:11:02,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:11:02,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:10:54" (1/3) ... [2025-02-06 02:11:02,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7f2b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:02, skipping insertion in model container [2025-02-06 02:11:02,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:10:55" (2/3) ... [2025-02-06 02:11:02,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7f2b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:02, skipping insertion in model container [2025-02-06 02:11:02,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:02" (3/3) ... [2025-02-06 02:11:02,400 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-53.i [2025-02-06 02:11:02,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:11:02,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-53.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:11:02,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:11:02,451 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;@3bafada0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:11:02,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:11:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 02:11:02,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 02:11:02,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:02,461 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:11:02,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash 476408593, now seen corresponding path program 1 times [2025-02-06 02:11:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733020235] [2025-02-06 02:11:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:11:02,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:11:02,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:11:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 02:11:02,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:11:02,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:11:02,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:02,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:02,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:11:02,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 02:11:02,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:11:02,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:11:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733020235] [2025-02-06 02:11:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733020235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:02,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:02,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:11:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910179255] [2025-02-06 02:11:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:02,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:11:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:11:02,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:11:02,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:02,830 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 02:11:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:02,848 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2025-02-06 02:11:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:11:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-02-06 02:11:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:02,856 INFO L225 Difference]: With dead ends: 70 [2025-02-06 02:11:02,856 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 02:11:02,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:02,863 INFO L435 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:02,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 02:11:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 02:11:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 02:11:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2025-02-06 02:11:02,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 72 [2025-02-06 02:11:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:02,892 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2025-02-06 02:11:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 02:11:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2025-02-06 02:11:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 02:11:02,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:02,894 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:11:02,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 02:11:03,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:11:03,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:03,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1098434860, now seen corresponding path program 1 times [2025-02-06 02:11:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130811141] [2025-02-06 02:11:03,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 02:11:03,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:11:03,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 02:11:03,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 02:11:03,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 02:11:03,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 02:11:03,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:03,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:03,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:11:03,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:15,514 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:11:23,661 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:11:29,333 WARN L286 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:11:33,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0)) (.cse1 (fp.lt c_~var_1_3~0 c_~var_1_4~0))) (and (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_4~0) .cse0)) .cse1) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) .cse0)) (not .cse1)))) is different from false [2025-02-06 02:11:37,429 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0)) (.cse1 (fp.lt c_~var_1_3~0 c_~var_1_4~0))) (and (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_4~0) .cse0)) .cse1) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) .cse0)) (not .cse1)))) is different from true [2025-02-06 02:11:52,487 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:12:05,632 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:12:22,359 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 02:12:30,552 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)