./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d6309e89b59d774d489fa719c310727c3028fbc925a23cebee2c14e16b155218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:49:44,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:49:44,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:49:44,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:49:44,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:49:44,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:49:44,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:49:44,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:49:44,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:49:44,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:49:44,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:49:44,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:49:44,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:49:44,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:49:44,788 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:49:44,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:49:44,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:49:44,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:49:44,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:44,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:49:44,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:49:44,791 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/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 -> d6309e89b59d774d489fa719c310727c3028fbc925a23cebee2c14e16b155218 [2025-03-17 02:49:45,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:49:45,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:49:45,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:49:45,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:49:45,016 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:49:45,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:49:46,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cca5a7f9/e986bc0ac6a148bd90d29daf13031ac7/FLAGf75591903 [2025-03-17 02:49:46,447 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:49:46,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:49:46,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cca5a7f9/e986bc0ac6a148bd90d29daf13031ac7/FLAGf75591903 [2025-03-17 02:49:46,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cca5a7f9/e986bc0ac6a148bd90d29daf13031ac7 [2025-03-17 02:49:46,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:49:46,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:49:46,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:46,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:49:46,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:49:46,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:46,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17293f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46, skipping insertion in model container [2025-03-17 02:49:46,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:46,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:49:46,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i[917,930] [2025-03-17 02:49:46,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:46,928 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:49:46,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i[917,930] [2025-03-17 02:49:46,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:49:46,974 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:49:46,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46 WrapperNode [2025-03-17 02:49:46,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:49:46,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:46,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:49:46,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:49:46,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:46,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,012 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-17 02:49:47,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:49:47,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:49:47,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:49:47,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:49:47,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,036 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-03-17 02:49:47,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:49:47,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:49:47,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:49:47,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:49:47,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (1/1) ... [2025-03-17 02:49:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:49:47,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:47,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:49:47,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:49:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:49:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:49:47,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:49:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:49:47,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:49:47,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:49:47,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:49:47,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:49:47,340 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:49:47,340 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:49:47,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:49:47,351 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:49:47,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:47 BoogieIcfgContainer [2025-03-17 02:49:47,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:49:47,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:49:47,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:49:47,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:49:47,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:46" (1/3) ... [2025-03-17 02:49:47,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82e2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:47, skipping insertion in model container [2025-03-17 02:49:47,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:46" (2/3) ... [2025-03-17 02:49:47,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c82e2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:47, skipping insertion in model container [2025-03-17 02:49:47,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:47" (3/3) ... [2025-03-17 02:49:47,361 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:49:47,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:49:47,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-91.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:49:47,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:49:47,429 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;@5f25a5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:49:47,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:49:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:49:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:49:47,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:47,442 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:49:47,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1851378266, now seen corresponding path program 1 times [2025-03-17 02:49:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706561667] [2025-03-17 02:49:47,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:47,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:49:47,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:49:47,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:47,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:49:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:49:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706561667] [2025-03-17 02:49:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706561667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:49:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489122763] [2025-03-17 02:49:47,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:49:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:49:47,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:49:47,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:49:47,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:49:47,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:49:47,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:47,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:49:47,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:49:47,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:49:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:49:47,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:49:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489122763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:49:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:49:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:49:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143159328] [2025-03-17 02:49:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:49:47,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:49:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:49:47,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:49:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:49:47,847 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:49:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:49:47,862 INFO L93 Difference]: Finished difference Result 91 states and 159 transitions. [2025-03-17 02:49:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:49:47,864 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2025-03-17 02:49:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:49:47,868 INFO L225 Difference]: With dead ends: 91 [2025-03-17 02:49:47,868 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 02:49:47,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-03-17 02:49:47,873 INFO L435 NwaCegarLoop]: 68 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, 68 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-03-17 02:49:47,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:49:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 02:49:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 02:49:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:49:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-03-17 02:49:47,903 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 104 [2025-03-17 02:49:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:49:47,904 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-03-17 02:49:47,904 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:49:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2025-03-17 02:49:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:49:47,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:49:47,908 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:49:47,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:49:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:49:48,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:49:48,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:49:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1221054557, now seen corresponding path program 1 times [2025-03-17 02:49:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:49:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285268749] [2025-03-17 02:49:48,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:49:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:49:48,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:49:48,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:49:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:49:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:50:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 02:50:22,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:50:22,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285268749] [2025-03-17 02:50:22,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285268749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:50:22,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:50:22,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:50:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600192810] [2025-03-17 02:50:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:50:22,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:50:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:50:22,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:50:22,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:50:22,285 INFO L87 Difference]: Start difference. First operand 45 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:50:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:50:26,799 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2025-03-17 02:50:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:50:26,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2025-03-17 02:50:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:50:26,801 INFO L225 Difference]: With dead ends: 106 [2025-03-17 02:50:26,801 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 02:50:26,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:50:26,802 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:50:26,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 02:50:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 02:50:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 64. [2025-03-17 02:50:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:50:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-03-17 02:50:26,813 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 104 [2025-03-17 02:50:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:50:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-03-17 02:50:26,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:50:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-03-17 02:50:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:50:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:50:26,816 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:50:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:50:26,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:50:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:50:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1220131036, now seen corresponding path program 1 times [2025-03-17 02:50:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:50:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707218494] [2025-03-17 02:50:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:50:26,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:50:26,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:50:26,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:26,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:50:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 02:50:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:50:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707218494] [2025-03-17 02:50:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707218494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:50:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:50:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:50:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179600337] [2025-03-17 02:50:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:50:52,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:50:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:50:52,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:50:52,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:50:52,604 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:50:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:50:58,075 INFO L93 Difference]: Finished difference Result 155 states and 222 transitions. [2025-03-17 02:50:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:50:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2025-03-17 02:50:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:50:58,078 INFO L225 Difference]: With dead ends: 155 [2025-03-17 02:50:58,078 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 02:50:58,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:50:58,079 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 56 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:50:58,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 290 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 02:50:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 02:50:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2025-03-17 02:50:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 02:50:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2025-03-17 02:50:58,089 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 104 [2025-03-17 02:50:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:50:58,090 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2025-03-17 02:50:58,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:50:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2025-03-17 02:50:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:50:58,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:50:58,091 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:50:58,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:50:58,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:50:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:50:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -333550876, now seen corresponding path program 1 times [2025-03-17 02:50:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:50:58,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034196733] [2025-03-17 02:50:58,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:50:58,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:50:58,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:50:58,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:58,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:50:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183993627] [2025-03-17 02:50:58,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:50:58,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:50:58,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:50:58,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:50:58,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:50:58,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:50:58,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:50:58,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:58,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:50:58,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:50:58,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:50:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:50:58,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:50:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:50:58,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:50:58,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:50:58,273 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:50:58,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:50:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 02:50:58,478 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 02:50:58,523 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:50:58,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:50:58 BoogieIcfgContainer [2025-03-17 02:50:58,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:50:58,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:50:58,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:50:58,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:50:58,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:47" (3/4) ... [2025-03-17 02:50:58,530 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:50:58,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:50:58,533 INFO L158 Benchmark]: Toolchain (without parser) took 71771.01ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 106.4MB in the beginning and 646.7MB in the end (delta: -540.3MB). Peak memory consumption was 621.2MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,534 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:50:58,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.11ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,534 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:50:58,535 INFO L158 Benchmark]: IcfgBuilder took 300.74ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 74.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,535 INFO L158 Benchmark]: TraceAbstraction took 71172.99ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 73.1MB in the beginning and 647.1MB in the end (delta: -574.0MB). Peak memory consumption was 579.3MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,536 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 1.3GB. Free memory was 647.1MB in the beginning and 646.7MB in the end (delta: 424.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:50:58,537 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.11ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.74ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 74.1MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 71172.99ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 73.1MB in the beginning and 647.1MB in the end (delta: -574.0MB). Peak memory consumption was 579.3MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 1.3GB. Free memory was 647.1MB in the beginning and 646.7MB in the end (delta: 424.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someUnaryDOUBLEoperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] float var_1_2 = 49.25; [L24] unsigned long int var_1_3 = 64; [L25] unsigned long int var_1_4 = 64; [L26] signed short int var_1_5 = 1; [L27] float var_1_6 = 8.4; [L28] float var_1_7 = -0.25; [L29] signed short int var_1_8 = -4; [L30] unsigned long int var_1_9 = 64; [L31] unsigned long int var_1_10 = 16; [L32] unsigned long int var_1_11 = 10; [L33] signed short int var_1_12 = 100; [L34] signed short int var_1_14 = 128; [L35] signed short int var_1_15 = 10; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_float() [L70] 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_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L70] 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_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=64, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L71] var_1_3 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L73] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=64, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L74] var_1_4 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_4 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L76] RET assume_abort_if_not(var_1_4 <= 4294967294) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_6=42/5, var_1_8=-4, var_1_9=64] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] 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_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L78] 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_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L80] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-4, var_1_9=64] [L81] var_1_8 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L82] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L83] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=16, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L84] var_1_10 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L85] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L86] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L86] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L87] var_1_11 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L88] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L89] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L89] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=128, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L90] var_1_14 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L91] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L92] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L92] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=10, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L93] var_1_15 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L94] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L95] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L95] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L108] RET updateVariables() [L109] CALL step() [L39] COND FALSE !(var_1_2 >= 50.4f) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=1, var_1_8=-32767, var_1_9=64] [L42] COND FALSE !(var_1_3 == (var_1_1 * var_1_4)) [L49] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=-32767, var_1_8=-32767, var_1_9=64] [L51] COND TRUE ! (var_1_4 < var_1_3) [L52] var_1_9 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=100, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L56] COND FALSE !(var_1_10 > var_1_9) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return ((((var_1_2 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) && ((var_1_3 == (var_1_1 * var_1_4)) ? ((var_1_2 >= (var_1_6 + var_1_7)) ? (var_1_5 == ((signed short int) var_1_8)) : (var_1_5 == ((signed short int) 32))) : (var_1_5 == ((signed short int) var_1_8)))) && ((! (var_1_4 < var_1_3)) ? (var_1_9 == ((unsigned long int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_9 == ((unsigned long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))))) && ((var_1_10 > var_1_9) ? ((63.1 >= var_1_7) ? ((var_1_7 >= var_1_2) ? (var_1_12 == ((signed short int) (var_1_14 - var_1_15))) : (var_1_12 == ((signed short int) var_1_14))) : 1) : (var_1_12 == ((signed short int) var_1_15))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-1, var_1_15=0, var_1_1=100000000, var_1_3=100000001, var_1_4=-8489934591, var_1_5=-32767, var_1_8=-32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 89 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.1s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 638 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 217 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 20.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.9s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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-03-17 02:50:58,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d6309e89b59d774d489fa719c310727c3028fbc925a23cebee2c14e16b155218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:51:00,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:51:00,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:51:00,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:51:00,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:51:00,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:51:00,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:51:00,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:51:00,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:51:00,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:51:00,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:51:00,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:51:00,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:51:00,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:51:00,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:51:00,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:51:00,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:51:00,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:51:00,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:51:00,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:51:00,601 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/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 -> d6309e89b59d774d489fa719c310727c3028fbc925a23cebee2c14e16b155218 [2025-03-17 02:51:00,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:51:00,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:51:00,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:51:00,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:51:00,851 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:51:00,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:51:02,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12722abe1/dd53e6d6afda449fbd05e099dc80e5bb/FLAG2d37c4535 [2025-03-17 02:51:02,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:51:02,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:51:02,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12722abe1/dd53e6d6afda449fbd05e099dc80e5bb/FLAG2d37c4535 [2025-03-17 02:51:02,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12722abe1/dd53e6d6afda449fbd05e099dc80e5bb [2025-03-17 02:51:02,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:51:02,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:51:02,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:51:02,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:51:02,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:51:02,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29756c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02, skipping insertion in model container [2025-03-17 02:51:02,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:51:02,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i[917,930] [2025-03-17 02:51:02,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:51:02,788 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:51:02,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i[917,930] [2025-03-17 02:51:02,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:51:02,831 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:51:02,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02 WrapperNode [2025-03-17 02:51:02,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:51:02,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:51:02,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:51:02,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:51:02,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,867 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 02:51:02,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:51:02,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:51:02,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:51:02,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:51:02,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,899 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-03-17 02:51:02,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:51:02,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:51:02,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:51:02,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:51:02,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (1/1) ... [2025-03-17 02:51:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:51:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:51:02,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:51:02,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:51:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:51:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:51:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:51:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:51:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:51:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:51:03,031 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:51:03,033 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:51:03,698 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 02:51:03,698 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:51:03,705 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:51:03,705 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:51:03,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:51:03 BoogieIcfgContainer [2025-03-17 02:51:03,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:51:03,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:51:03,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:51:03,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:51:03,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:51:02" (1/3) ... [2025-03-17 02:51:03,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ce235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:51:03, skipping insertion in model container [2025-03-17 02:51:03,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:51:02" (2/3) ... [2025-03-17 02:51:03,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517ce235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:51:03, skipping insertion in model container [2025-03-17 02:51:03,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:51:03" (3/3) ... [2025-03-17 02:51:03,713 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-17 02:51:03,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:51:03,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-91.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:51:03,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:51:03,768 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;@201a27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:51:03,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:51:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:51:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:51:03,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:51:03,780 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:51:03,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:51:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:51:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1851378266, now seen corresponding path program 1 times [2025-03-17 02:51:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:51:03,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299389268] [2025-03-17 02:51:03,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:51:03,792 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-03-17 02:51:03,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:51:03,794 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 02:51:03,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 02:51:03,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:51:03,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:51:03,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:51:03,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:51:03,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:51:03,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:51:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:51:03,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:51:03,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:51:03,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299389268] [2025-03-17 02:51:03,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299389268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:51:03,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:51:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:51:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276211891] [2025-03-17 02:51:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:51:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:51:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:51:04,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:51:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:51:04,018 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:51:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:51:04,033 INFO L93 Difference]: Finished difference Result 91 states and 159 transitions. [2025-03-17 02:51:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:51:04,035 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2025-03-17 02:51:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:51:04,039 INFO L225 Difference]: With dead ends: 91 [2025-03-17 02:51:04,040 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 02:51:04,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-03-17 02:51:04,043 INFO L435 NwaCegarLoop]: 68 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, 68 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-03-17 02:51:04,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:51:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 02:51:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-17 02:51:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:51:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2025-03-17 02:51:04,086 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 104 [2025-03-17 02:51:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:51:04,086 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2025-03-17 02:51:04,086 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:51:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2025-03-17 02:51:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 02:51:04,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:51:04,088 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 02:51:04,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 02:51:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 02:51:04,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:51:04,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:51:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1221054557, now seen corresponding path program 1 times [2025-03-17 02:51:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:51:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026888921] [2025-03-17 02:51:04,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:51:04,290 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-03-17 02:51:04,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:51:04,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 02:51:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 02:51:04,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 02:51:04,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 02:51:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:51:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:51:04,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 02:51:04,469 INFO L279 TraceCheckSpWp]: Computing forward predicates...