./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 13:42:22,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:42:23,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:42:23,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:42:23,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:42:23,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:42:23,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:42:23,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:42:23,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:42:23,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:42:23,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:42:23,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:42:23,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:42:23,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:42:23,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:42:23,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:42:23,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:42:23,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:42:23,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:42:23,077 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-08 13:42:23,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:42:23,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:42:23,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:42:23,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:42:23,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:42:23,305 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-08 13:42:24,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48343608e/4683d3f079054bfe9761654de4c250d1/FLAG606d7a255 [2025-03-08 13:42:24,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:42:24,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-08 13:42:24,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48343608e/4683d3f079054bfe9761654de4c250d1/FLAG606d7a255 [2025-03-08 13:42:24,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48343608e/4683d3f079054bfe9761654de4c250d1 [2025-03-08 13:42:24,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:42:24,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:42:24,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:42:24,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:42:24,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:42:24,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e55661d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24, skipping insertion in model container [2025-03-08 13:42:24,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:42:24,774 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-08 13:42:24,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:42:24,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:42:24,835 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-08 13:42:24,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:42:24,870 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:42:24,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24 WrapperNode [2025-03-08 13:42:24,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:42:24,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:42:24,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:42:24,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:42:24,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,904 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-08 13:42:24,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:42:24,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:42:24,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:42:24,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:42:24,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,936 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-08 13:42:24,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:42:24,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:42:24,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:42:24,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:42:24,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (1/1) ... [2025-03-08 13:42:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:42:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:42:24,980 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-08 13:42:24,982 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-08 13:42:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:42:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:42:24,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:42:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:42:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:42:24,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:42:25,044 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:42:25,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:42:25,206 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:42:25,206 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:42:25,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:42:25,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:42:25,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:25 BoogieIcfgContainer [2025-03-08 13:42:25,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:42:25,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:42:25,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:42:25,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:42:25,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:42:24" (1/3) ... [2025-03-08 13:42:25,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68311229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:25, skipping insertion in model container [2025-03-08 13:42:25,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:42:24" (2/3) ... [2025-03-08 13:42:25,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68311229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:42:25, skipping insertion in model container [2025-03-08 13:42:25,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:25" (3/3) ... [2025-03-08 13:42:25,221 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-08 13:42:25,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:42:25,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-91.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:42:25,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:42:25,280 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;@c732fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:42:25,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:42:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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-08 13:42:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:42:25,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:42:25,294 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, 1, 1, 1, 1] [2025-03-08 13:42:25,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:42:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:42:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 60830420, now seen corresponding path program 1 times [2025-03-08 13:42:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:42:25,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213874996] [2025-03-08 13:42:25,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:42:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:42:25,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:42:25,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:42:25,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:42:25,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:42:25,468 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-08 13:42:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:42:25,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213874996] [2025-03-08 13:42:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213874996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:42:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720222605] [2025-03-08 13:42:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:42:25,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:42:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:42:25,476 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-08 13:42:25,477 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-08 13:42:25,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:42:25,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:42:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:42:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:42:25,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:42:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:42:25,612 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-08 13:42:25,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:42:25,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720222605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:42:25,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:42:25,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:42:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445514046] [2025-03-08 13:42:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:42:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:42:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:42:25,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:42:25,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:42:25,633 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-08 13:42:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:42:25,653 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-03-08 13:42:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:42:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 108 [2025-03-08 13:42:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:42:25,658 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:42:25,659 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:42:25,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-08 13:42:25,665 INFO L435 NwaCegarLoop]: 72 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, 72 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-08 13:42:25,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:42:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:42:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:42:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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-08 13:42:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-03-08 13:42:25,693 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 108 [2025-03-08 13:42:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:42:25,693 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-03-08 13:42:25,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-08 13:42:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-03-08 13:42:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:42:25,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:42:25,696 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, 1, 1, 1, 1] [2025-03-08 13:42:25,703 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-08 13:42:25,897 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-08 13:42:25,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:42:25,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:42:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1873971081, now seen corresponding path program 1 times [2025-03-08 13:42:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:42:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754846771] [2025-03-08 13:42:25,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:42:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:42:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:42:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:42:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:42:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:42:57,288 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-08 13:42:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:42:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754846771] [2025-03-08 13:42:57,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754846771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:42:57,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:42:57,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:42:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924665986] [2025-03-08 13:42:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:42:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:42:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:42:57,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:42:57,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:42:57,290 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-08 13:43:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:43:03,199 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2025-03-08 13:43:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:43:03,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 108 [2025-03-08 13:43:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:43:03,201 INFO L225 Difference]: With dead ends: 118 [2025-03-08 13:43:03,201 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 13:43:03,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:43:03,202 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 78 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:43:03,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 423 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 13:43:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 13:43:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2025-03-08 13:43:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 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-08 13:43:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2025-03-08 13:43:03,217 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2025-03-08 13:43:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:43:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2025-03-08 13:43:03,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-08 13:43:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2025-03-08 13:43:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:43:03,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:43:03,219 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, 1, 1, 1, 1] [2025-03-08 13:43:03,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:43:03,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:43:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:43:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1845341930, now seen corresponding path program 1 times [2025-03-08 13:43:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:43:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004487007] [2025-03-08 13:43:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:43:03,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:03,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:03,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:03,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:43:12,637 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-08 13:43:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:43:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004487007] [2025-03-08 13:43:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004487007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:43:12,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:43:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:43:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476483418] [2025-03-08 13:43:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:43:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:43:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:43:12,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:43:12,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:43:12,640 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-08 13:43:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:43:17,616 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2025-03-08 13:43:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:43:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 108 [2025-03-08 13:43:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:43:17,618 INFO L225 Difference]: With dead ends: 171 [2025-03-08 13:43:17,618 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 13:43:17,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:43:17,619 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:43:17,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 342 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 13:43:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 13:43:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2025-03-08 13:43:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 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-08 13:43:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2025-03-08 13:43:17,628 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 108 [2025-03-08 13:43:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:43:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2025-03-08 13:43:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-08 13:43:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2025-03-08 13:43:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:43:17,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:43:17,629 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, 1, 1, 1, 1] [2025-03-08 13:43:17,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:43:17,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:43:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:43:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash -131160746, now seen corresponding path program 1 times [2025-03-08 13:43:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:43:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277632649] [2025-03-08 13:43:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:43:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:17,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:17,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:17,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:43:17,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182472485] [2025-03-08 13:43:17,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:43:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:43:17,683 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-08 13:43:17,685 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-08 13:43:17,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:17,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:17,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:17,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:43:17,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:43:17,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:17,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:17,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:43:17,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:43:17,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:43:17,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:43:17,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:43:18,037 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-08 13:43:18,040 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 13:43:18,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:43:18,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:43:18 BoogieIcfgContainer [2025-03-08 13:43:18,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:43:18,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:43:18,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:43:18,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:43:18,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:42:25" (3/4) ... [2025-03-08 13:43:18,107 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:43:18,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:43:18,108 INFO L158 Benchmark]: Toolchain (without parser) took 53452.11ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 104.4MB in the beginning and 490.1MB in the end (delta: -385.7MB). Peak memory consumption was 256.4MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,108 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:43:18,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.89ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 92.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.99ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,109 INFO L158 Benchmark]: Boogie Preprocessor took 40.66ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:43:18,109 INFO L158 Benchmark]: IcfgBuilder took 262.29ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 72.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,109 INFO L158 Benchmark]: TraceAbstraction took 52886.60ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 72.4MB in the beginning and 490.4MB in the end (delta: -418.0MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,109 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 780.1MB. Free memory was 490.4MB in the beginning and 490.1MB in the end (delta: 249.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:43:18,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.89ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 92.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.99ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.66ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.29ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 72.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52886.60ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 72.4MB in the beginning and 490.4MB in the end (delta: -418.0MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 780.1MB. Free memory was 490.4MB in the beginning and 490.1MB in the end (delta: 249.3kB). 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 39, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 70, 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; VAL [isInitial=0, 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_2=197/4, 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] [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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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=-4194967295, 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))) ; VAL [\result=0, 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=-4194967295, var_1_5=-32767, var_1_8=-32767, var_1_9=0] [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=-4194967295, 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=-4194967295, var_1_5=-32767, var_1_8=-32767, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.8s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 231 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 76 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 245 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-08 13:43:18,143 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-?-e2fb8be-m [2025-03-08 13:43:19,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:43:20,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:43:20,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:43:20,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:43:20,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:43:20,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:43:20,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:43:20,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:43:20,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:43:20,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:43:20,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:43:20,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:43:20,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:43:20,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:43:20,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:43:20,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:43:20,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:43:20,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:43:20,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:43:20,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:43:20,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:43:20,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:43:20,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:43:20,073 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-08 13:43:20,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:43:20,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:43:20,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:43:20,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:43:20,327 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:43:20,327 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-08 13:43:21,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb3df99a/7a3e0b3a1ad2433b9cfe58a2d1f7a845/FLAGd9cb5c2cb [2025-03-08 13:43:21,740 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:43:21,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-08 13:43:21,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb3df99a/7a3e0b3a1ad2433b9cfe58a2d1f7a845/FLAGd9cb5c2cb [2025-03-08 13:43:21,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb3df99a/7a3e0b3a1ad2433b9cfe58a2d1f7a845 [2025-03-08 13:43:21,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:43:21,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:43:21,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:43:21,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:43:21,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:43:21,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:43:21" (1/1) ... [2025-03-08 13:43:21,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184066a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:21, skipping insertion in model container [2025-03-08 13:43:21,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:43:21" (1/1) ... [2025-03-08 13:43:21,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:43:21,902 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-08 13:43:21,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:43:21,952 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:43:21,963 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-08 13:43:21,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:43:22,000 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:43:22,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22 WrapperNode [2025-03-08 13:43:22,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:43:22,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:43:22,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:43:22,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:43:22,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,036 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-08 13:43:22,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:43:22,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:43:22,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:43:22,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:43:22,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,062 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-08 13:43:22,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:43:22,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:43:22,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:43:22,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:43:22,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (1/1) ... [2025-03-08 13:43:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:43:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:43:22,104 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-08 13:43:22,109 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-08 13:43:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:43:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:43:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:43:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:43:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:43:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:43:22,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:43:22,185 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:43:22,939 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:43:22,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:43:22,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:43:22,948 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:43:22,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:43:22 BoogieIcfgContainer [2025-03-08 13:43:22,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:43:22,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:43:22,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:43:22,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:43:22,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:43:21" (1/3) ... [2025-03-08 13:43:22,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7aa849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:43:22, skipping insertion in model container [2025-03-08 13:43:22,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:43:22" (2/3) ... [2025-03-08 13:43:22,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7aa849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:43:22, skipping insertion in model container [2025-03-08 13:43:22,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:43:22" (3/3) ... [2025-03-08 13:43:22,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-91.i [2025-03-08 13:43:22,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:43:22,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-91.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:43:23,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:43:23,016 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;@a1559bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:43:23,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:43:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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-08 13:43:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:43:23,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:43:23,029 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, 1, 1, 1, 1] [2025-03-08 13:43:23,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:43:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:43:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 60830420, now seen corresponding path program 1 times [2025-03-08 13:43:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:43:23,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335585410] [2025-03-08 13:43:23,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:23,040 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-08 13:43:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:43:23,042 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-08 13:43:23,043 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-08 13:43:23,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:43:23,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:43:23,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:43:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-08 13:43:23,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:43:23,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:43:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335585410] [2025-03-08 13:43:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335585410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:43:23,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:43:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:43:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068292432] [2025-03-08 13:43:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:43:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:43:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:43:23,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:43:23,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:43:23,271 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:43:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:43:23,286 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2025-03-08 13:43:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:43:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 13:43:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:43:23,292 INFO L225 Difference]: With dead ends: 98 [2025-03-08 13:43:23,292 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 13:43:23,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-08 13:43:23,296 INFO L435 NwaCegarLoop]: 72 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, 72 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-08 13:43:23,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:43:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 13:43:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 13:43:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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-08 13:43:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2025-03-08 13:43:23,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 108 [2025-03-08 13:43:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:43:23,342 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2025-03-08 13:43:23,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:43:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2025-03-08 13:43:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 13:43:23,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:43:23,347 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, 1, 1, 1, 1] [2025-03-08 13:43:23,354 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 13:43:23,547 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-08 13:43:23,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:43:23,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:43:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1873971081, now seen corresponding path program 1 times [2025-03-08 13:43:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:43:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533151954] [2025-03-08 13:43:23,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:43:23,549 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-08 13:43:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:43:23,551 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-08 13:43:23,552 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-08 13:43:23,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 13:43:23,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 13:43:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:43:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:43:23,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 13:43:23,704 INFO L279 TraceCheckSpWp]: Computing forward predicates...