./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.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 c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:47:45,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:47:45,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:47:45,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:47:45,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:47:45,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:47:45,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:47:45,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:47:45,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:47:45,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:47:45,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:47:45,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:47:45,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:47:45,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:47:45,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:47:45,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:47:45,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:47:45,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:47:45,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:47:45,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:45,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:47:45,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:47:45,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:47:45,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:47:45,783 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 -> c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 [2025-03-17 02:47:46,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:47:46,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:47:46,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:47:46,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:47:46,053 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:47:46,056 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-73.i [2025-03-17 02:47:47,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc406b145/592edbe607ba431dbad99e46e2ac5e92/FLAG39f851c47 [2025-03-17 02:47:47,583 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:47:47,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-17 02:47:47,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc406b145/592edbe607ba431dbad99e46e2ac5e92/FLAG39f851c47 [2025-03-17 02:47:47,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc406b145/592edbe607ba431dbad99e46e2ac5e92 [2025-03-17 02:47:47,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:47:47,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:47:47,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:47,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:47:47,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:47:47,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:47" (1/1) ... [2025-03-17 02:47:47,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:47, skipping insertion in model container [2025-03-17 02:47:47,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:47" (1/1) ... [2025-03-17 02:47:47,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:47:47,987 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-73.i[917,930] [2025-03-17 02:47:48,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:48,044 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:47:48,051 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-73.i[917,930] [2025-03-17 02:47:48,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:48,077 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:47:48,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48 WrapperNode [2025-03-17 02:47:48,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:48,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:48,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:47:48,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:47:48,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,112 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 02:47:48,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:48,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:47:48,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:47:48,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:47:48,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:47:48,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,138 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:47:48,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:47:48,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:47:48,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:47:48,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (1/1) ... [2025-03-17 02:47:48,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:48,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:47:48,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:47:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:47:48,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:47:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:47:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:47:48,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:47:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:47:48,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:47:48,257 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:47:48,473 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:47:48,473 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:47:48,481 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:47:48,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:47:48,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:48 BoogieIcfgContainer [2025-03-17 02:47:48,482 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:47:48,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:47:48,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:47:48,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:47:48,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:47" (1/3) ... [2025-03-17 02:47:48,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b55135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:48, skipping insertion in model container [2025-03-17 02:47:48,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:48" (2/3) ... [2025-03-17 02:47:48,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b55135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:48, skipping insertion in model container [2025-03-17 02:47:48,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:48" (3/3) ... [2025-03-17 02:47:48,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-17 02:47:48,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:47:48,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-73.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:47:48,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:47:48,557 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;@366f2ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:47:48,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:47:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:47:48,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:48,568 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:48,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:48,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 980951990, now seen corresponding path program 1 times [2025-03-17 02:47:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:48,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-03-17 02:47:48,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:48,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:47:48,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:47:48,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:48,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 02:47:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-03-17 02:47:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405973091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:47:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712250309] [2025-03-17 02:47:48,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:48,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:47:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:48,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:47:48,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:47:48,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:47:48,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:47:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:48,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:47:48,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 02:47:48,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712250309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:48,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:47:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:47:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672354681] [2025-03-17 02:47:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:47:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:48,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:47:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:48,957 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:47:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:48,975 INFO L93 Difference]: Finished difference Result 89 states and 151 transitions. [2025-03-17 02:47:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:47:48,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 02:47:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:48,981 INFO L225 Difference]: With dead ends: 89 [2025-03-17 02:47:48,981 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 02:47:48,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:48,985 INFO L435 NwaCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:48,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 02:47:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 02:47:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 02:47:49,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2025-03-17 02:47:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 02:47:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:47:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 02:47:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:47:49,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:49,030 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:49,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:47:49,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:47:49,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1928249095, now seen corresponding path program 1 times [2025-03-17 02:47:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-17 02:47:49,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:49,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:47:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:47:49,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:49,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 02:47:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741556431] [2025-03-17 02:47:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741556431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:47:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709554628] [2025-03-17 02:47:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:49,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:47:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:49,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:47:49,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:47:49,618 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:49,733 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2025-03-17 02:47:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:47:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-03-17 02:47:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:49,734 INFO L225 Difference]: With dead ends: 119 [2025-03-17 02:47:49,734 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 02:47:49,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:47:49,735 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 60 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:49,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:47:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 02:47:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2025-03-17 02:47:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 02:47:49,747 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2025-03-17 02:47:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:49,748 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 02:47:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2025-03-17 02:47:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 02:47:49,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:49,750 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:47:49,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:49,753 INFO L85 PathProgramCache]: Analyzing trace with hash 352928425, now seen corresponding path program 1 times [2025-03-17 02:47:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:49,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-03-17 02:47:49,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:49,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:47:49,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:47:49,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:49,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 02:47:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:47:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-03-17 02:47:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044953435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:47:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470775444] [2025-03-17 02:47:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:47:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:47:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:47:49,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:47:49,852 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:49,897 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2025-03-17 02:47:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:47:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-17 02:47:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:49,898 INFO L225 Difference]: With dead ends: 99 [2025-03-17 02:47:49,898 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 02:47:49,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:47:49,899 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:49,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 02:47:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-17 02:47:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-17 02:47:49,907 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2025-03-17 02:47:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:49,907 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-17 02:47:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-17 02:47:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 02:47:49,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:49,909 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:49,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:47:49,909 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash 352958216, now seen corresponding path program 1 times [2025-03-17 02:47:49,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:47:49,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578679955] [2025-03-17 02:47:49,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:47:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:47:49,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:47:49,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:49,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:47:49,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:47:49,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:47:50,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:47:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:50,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:47:50,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:47:50,045 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:47:50,046 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:47:50,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:47:50,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 02:47:50,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:47:50,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:47:50 BoogieIcfgContainer [2025-03-17 02:47:50,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:47:50,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:47:50,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:47:50,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:47:50,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:48" (3/4) ... [2025-03-17 02:47:50,118 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:47:50,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:47:50,119 INFO L158 Benchmark]: Toolchain (without parser) took 2251.51ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 85.8MB in the end (delta: 22.6MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2025-03-17 02:47:50,119 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:50,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.64ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 94.8MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:47:50,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:50,119 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:50,120 INFO L158 Benchmark]: IcfgBuilder took 338.82ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 72.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:47:50,120 INFO L158 Benchmark]: TraceAbstraction took 1630.15ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 85.9MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:50,120 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:47:50,121 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.23ms. Allocated memory is still 167.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.64ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 94.8MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.11ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 338.82ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 72.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1630.15ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 85.9MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 85.8MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] float var_1_12 = 15.75; [L29] float var_1_13 = 1.6; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] float var_1_16 = 16.5; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] float last_1_var_1_12 = 15.75; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L83] var_1_13 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L84] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L87] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=4] [L109] RET updateVariables() [L110] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=4, var_1_9=4] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=4, var_1_1=11/2, var_1_6=1, var_1_8=4, var_1_9=4] [L48] COND FALSE !(var_1_19 > var_1_9) [L59] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=4, var_1_1=11/2, var_1_6=1, var_1_8=4, var_1_9=4] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=8, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=4, var_1_1=11/2, var_1_6=1, var_1_8=4, var_1_9=4] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=4, var_1_1=11/2, var_1_6=1, var_1_8=4, var_1_9=4] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=126, var_1_19=4, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=4, var_1_9=4] [L69] var_1_17 = var_1_18 [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((float) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((float) (var_1_13 - var_1_16))) : (var_1_12 == ((float) var_1_16)))) : (var_1_12 == ((float) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=126, var_1_18=126, var_1_19=4, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=4, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=131, var_1_13=131, var_1_14=1, var_1_15=1, var_1_17=126, var_1_18=126, var_1_19=4, var_1_1=132, var_1_6=1, var_1_7=132, var_1_8=4, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 233 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1652/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:47:50,136 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-73.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 c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:47:52,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:47:52,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:47:52,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:47:52,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:47:52,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:47:52,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:47:52,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:47:52,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:47:52,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:47:52,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:47:52,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:47:52,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:47:52,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:47:52,135 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:47:52,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:47:52,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:47:52,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:47:52,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:52,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:47:52,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:47:52,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:47:52,138 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 -> c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 [2025-03-17 02:47:52,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:47:52,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:47:52,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:47:52,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:47:52,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:47:52,398 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-73.i [2025-03-17 02:47:53,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdb42468/dccd231bf2854102938f0c84217e3567/FLAG8465526c8 [2025-03-17 02:47:53,756 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:47:53,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-17 02:47:53,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdb42468/dccd231bf2854102938f0c84217e3567/FLAG8465526c8 [2025-03-17 02:47:53,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdb42468/dccd231bf2854102938f0c84217e3567 [2025-03-17 02:47:53,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:47:53,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:47:53,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:53,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:47:53,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:47:53,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:53,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53, skipping insertion in model container [2025-03-17 02:47:53,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:53,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:47:53,886 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-73.i[917,930] [2025-03-17 02:47:53,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:53,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:47:53,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i[917,930] [2025-03-17 02:47:53,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:47:53,961 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:47:53,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53 WrapperNode [2025-03-17 02:47:53,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:47:53,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:53,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:47:53,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:47:53,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:53,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,000 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-17 02:47:54,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:47:54,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:47:54,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:47:54,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:47:54,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:47:54,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:47:54,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:47:54,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:47:54,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:47:54,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (1/1) ... [2025-03-17 02:47:54,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:47:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:47:54,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:47:54,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:47:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:47:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:47:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:47:54,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:47:54,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:47:54,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:47:54,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:47:54,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:47:56,108 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:47:56,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:47:56,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:47:56,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:47:56,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:56 BoogieIcfgContainer [2025-03-17 02:47:56,120 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:47:56,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:47:56,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:47:56,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:47:56,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:53" (1/3) ... [2025-03-17 02:47:56,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff49df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:56, skipping insertion in model container [2025-03-17 02:47:56,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:53" (2/3) ... [2025-03-17 02:47:56,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff49df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:56, skipping insertion in model container [2025-03-17 02:47:56,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:56" (3/3) ... [2025-03-17 02:47:56,128 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2025-03-17 02:47:56,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:47:56,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-73.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:47:56,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:47:56,184 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;@43bba214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:47:56,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:47:56,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:47:56,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:56,193 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:56,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 980951990, now seen corresponding path program 1 times [2025-03-17 02:47:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506827651] [2025-03-17 02:47:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:56,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:47:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:56,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:47:56,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:47:56,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:47:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:47:56,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:56,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:56,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:47:56,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 02:47:56,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:56,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506827651] [2025-03-17 02:47:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506827651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:56,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:47:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596999516] [2025-03-17 02:47:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:56,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:47:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:56,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:47:56,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:56,512 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:47:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:56,533 INFO L93 Difference]: Finished difference Result 89 states and 151 transitions. [2025-03-17 02:47:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:47:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 02:47:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:56,540 INFO L225 Difference]: With dead ends: 89 [2025-03-17 02:47:56,540 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 02:47:56,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:47:56,547 INFO L435 NwaCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:56,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:47:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 02:47:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 02:47:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2025-03-17 02:47:56,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2025-03-17 02:47:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:56,597 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2025-03-17 02:47:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 02:47:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2025-03-17 02:47:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:47:56,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:56,600 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:56,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:47:56,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:47:56,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:56,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1928249095, now seen corresponding path program 1 times [2025-03-17 02:47:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731551256] [2025-03-17 02:47:56,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:47:56,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:56,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:47:56,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:47:56,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:47:57,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:47:57,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:57,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:57,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:47:57,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 02:47:57,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:57,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731551256] [2025-03-17 02:47:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731551256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:57,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:47:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771563969] [2025-03-17 02:47:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:57,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:47:57,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:57,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:47:57,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:47:57,115 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:59,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:47:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:59,509 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2025-03-17 02:47:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:47:59,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-03-17 02:47:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:59,511 INFO L225 Difference]: With dead ends: 119 [2025-03-17 02:47:59,511 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 02:47:59,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:47:59,512 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 59 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:59,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 219 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 02:47:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 02:47:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2025-03-17 02:47:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:47:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-17 02:47:59,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2025-03-17 02:47:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:59,519 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-17 02:47:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:47:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2025-03-17 02:47:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 02:47:59,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:59,521 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:47:59,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:47:59,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:47:59,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:59,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 352928425, now seen corresponding path program 1 times [2025-03-17 02:47:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:59,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621766538] [2025-03-17 02:47:59,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:59,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:47:59,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:59,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:47:59,727 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 (4)] Waiting until timeout for monitored process [2025-03-17 02:47:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:47:59,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:47:59,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:59,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:59,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:47:59,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:47:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 02:47:59,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:47:59,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:47:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621766538] [2025-03-17 02:47:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621766538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:47:59,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:47:59,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:47:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281258384] [2025-03-17 02:47:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:47:59,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:47:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:47:59,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:47:59,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:47:59,953 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:48:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:01,850 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2025-03-17 02:48:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:48:01,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-17 02:48:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:01,868 INFO L225 Difference]: With dead ends: 99 [2025-03-17 02:48:01,868 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 02:48:01,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:48:01,869 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 02:48:01,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 02:48:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 02:48:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-17 02:48:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 02:48:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-17 02:48:01,876 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2025-03-17 02:48:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-17 02:48:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 02:48:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-17 02:48:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 02:48:01,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:01,877 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:48:01,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 02:48:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:48:02,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 352958216, now seen corresponding path program 1 times [2025-03-17 02:48:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:48:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315780438] [2025-03-17 02:48:02,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:48:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:48:02,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:48:02,083 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 (5)] Waiting until timeout for monitored process [2025-03-17 02:48:02,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:48:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:48:02,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:02,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:02,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 02:48:02,285 INFO L279 TraceCheckSpWp]: Computing forward predicates...